Antimagic Labeling of Regular Graphs
Work
Year: 2015
Type: article
Abstract: A graph is antimagic if there is a one-to-one correspondence such that for any two vertices , . It is known that bipartite regular graphs are antimagic and nonbipartite regular graphs of odd degree at... more
Source: Journal of Graph Theory
Institutions National Taiwan Normal University, National Pingtung University, Tamkang University, Zhejiang Normal University
Cites: 17
Cited by: 82
Related to: 10
FWCI: 6.192
Citation percentile (by year/subfield): 95.19
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze