Vertex-antimagic labelings of regular graphs

DOI10.1007/s10114-012-1018-yzbMath1260.05134OpenAlexW2399919305MaRDI QIDQ1943210

Martin Bača, Ali Ahmad, Andrea Semaničová-Feňovčíková, Petr Kovář, Kashif Ali

Publication date: 15 March 2013

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-012-1018-y

zbMATH Keywords

regular graphsuper vertex-antimagic total labelingvertex-antimagic edge labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

Enumeration of the edge weights of symmetrically designed graphs

Cites Work

• Labelings of plane graphs containing Hamilton path
• Smallest close to regular bipartite graphs without an almost perfect matching
• Super \(d\)-antimagic labelings of disconnected plane graphs
• Magic labelings of regular graphs
• Two new methods to obtain super vertex-magic total labelings of graphs
• Hamiltonicity of 4-connected graphs
• Super-vertex-antimagic total labelings of disconnected graphs
• A dynamic survey of graph labeling
• Edge-pancyclicity and Hamiltonian connectivity of twisted cubes
• Solution of the conjecture: if \(n\equiv 0 \pmod 4\), \(n>4\), then \(K_n\) has a super vertex-magic total labeling
• Vertex-magic total labeling of odd complete graphs
• Dense graphs are antimagic
• Vertex-antimagic total labelings of graphs
• Vertex‐Magic Total Labelings of Regular Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Vertex-antimagic labelings of regular graphs