On Magic and Supermagic Line Graphs
ثبت نشده
چکیده
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.
منابع مشابه
Balanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملMagic and supermagic dense bipartite graphs
A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (and consecutive) positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In the paper we prove that any balanced bipartite graph with minimum degree greater than |V (G)|/4 ≥ 2 is magic. A similar result is presented for supermag...
متن کاملH-supermagic labelings of graphs
A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to H. The graph G is H−magic if there exists a bijection f : V (G) [ E(G) ! {1, 2, 3, · · · , |V (G) [ E(G)|} such that for every subgraph H0 P of G isomorphic to H. G is said to be H − supermagic if f(V (G)) = {1, 2, 3, · · · , |V (G)|}. In thi...
متن کاملA characterization of complete tripartite degree-magic graphs
A graph is called degree-magic if it admits a labelling of the edges by integers 1, 2, . . . , |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal to 1+|E(G)| 2 deg(v). Degree-magic graphs extend supermagic regular graphs. In this paper we characterize complete tripartite degree-magic graphs.
متن کاملLargest cliques in connected supermagic graphs
A graph G = (V, E) is said to be magic if there exists an integer labeling f : V ∪ E −→ [1, |V ∪ E|] such that f(x) + f(y) + f(xy) is constant for all edges xy ∈ E. Enomoto, Masuda and Nakamigawa proved that there are magic graphs of order at most 3n + o(n) which contain a complete graph of order n. Bounds on Sidon sets show that the order of such a graph is at least n + o(n). We close the gap ...
متن کامل