Handicap distance antimagic graphs and incomplete tournaments
From MaRDI portal
Publication:2443440
zbMath1301.05289MaRDI QIDQ2443440
Publication date: 7 April 2014
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Directed graphs (digraphs), tournaments (05C20)
Related Items (19)
Distance magic Cartesian products of graphs ⋮ Regular handicap graphs of order n ≡ 4 (mod 8) ⋮ Unnamed Item ⋮ A $$\varGamma $$-magic Rectangle Set and Group Distance Magic Labeling ⋮ On regular handicap graphs of even order ⋮ Magic partially filled arrays on abelian groups ⋮ Constant and nearly constant block-sum partially balanced incomplete block designs and magic rectangles ⋮ Quasimagic rectangles ⋮ Local distance antimagic chromatic number for the union of star and double star graphs ⋮ A magic rectangle set on abelian groups and its application ⋮ Bimagic vertex labelings ⋮ Union of distance magic graphs ⋮ \((a,d)\)-distance antimagic labeling of some types of graphs ⋮ On \((a,d)\)-distance anti-magic and 1-vertex bimagic vertex labelings of certain types of graphs ⋮ A note on incomplete regular tournaments with handicap two of order n≡8(mod 16) ⋮ On distance labelings of 2-regular graphs ⋮ Combinatorial configurations in the definition of antimagic labelings of graphs ⋮ Some results on (a,d)-distance antimagic labeling ⋮ Regular handicap graphs of order $n \equiv 0$ (mod 8)
This page was built for publication: Handicap distance antimagic graphs and incomplete tournaments
