On regular handicap graphs of order $n \equiv 0$ mod 8

On regular handicap graphs of order $n \equiv 0$ mod 8

<p>A handicap distance antimagic labeling of a graph <span class="math"><em>G</em> = (<em>V</em>, <em>E</em>)</span> with <span class="math"><em>n</em></span> vertices is a bijection <span class=&quo...

Full description

Bibliographic Details
Main Authors: Dalibor Froncek, Aaron Shepanik
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2018-10-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
graph labeling, handicap labeling, regular graphs, tournament scheduling
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/506

Internet

https://www.ejgta.org/index.php/ejgta/article/view/506

Similar Items