A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise different (and consecutive) integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we characterize magic joins of graphs and we establish some conditions for magic joins of graphs to be supermagic.
机构:
Inst Teknol Bandung, Fac Math & Nat Sci, Combinatorial Math Res Grp, Bandung, Indonesia
Univ Merdeka Malang, Dept Civil Engn, Malang, IndonesiaInst Teknol Bandung, Fac Math & Nat Sci, Combinatorial Math Res Grp, Bandung, Indonesia
Ngurah, A. A. G.
Baskoro, E. T.
论文数: 0引用数: 0
h-index: 0
机构:
Inst Teknol Bandung, Fac Math & Nat Sci, Combinatorial Math Res Grp, Bandung, Indonesia
Govt Coll Univ, Sch Math Sci, Lahore, PakistanInst Teknol Bandung, Fac Math & Nat Sci, Combinatorial Math Res Grp, Bandung, Indonesia
Baskoro, E. T.
Tomescu, I.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Bucharest, Fac Math & Comp Sci, Bucharest 010014, Romania
Govt Coll Univ, Sch Math Sci, Lahore, PakistanInst Teknol Bandung, Fac Math & Nat Sci, Combinatorial Math Res Grp, Bandung, Indonesia