J. Ivanco, Z. Lastivkova, A. Semanicova, Department of Geometry and Algebra, P. J. Safarik University, 041 54 Kosice, Jesenna 5, Slovakia, e-mail: firstname.lastname@example.org, email@example.com
Abstract: A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (consecutive) positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. We characterize magic line graphs of general graphs and describe some class of supermagic line graphs of bipartite graphs.
Keywords: magic graphs, supermagic graphs, line graphs
Classification (MSC2000): 05C78
Full text of the article: