LAUSR

Magic Labeling of Disjoint Union Graphs

Sign Up to like & get
recommendations!
1 Published in 2019 at "Acta Mathematica Sinica, English Series"

DOI: 10.1007/s10114-019-8500-8

Abstract: Let G be a graph with vertex set V(G), edge set E(G) and maximum degree Δ respectively. G is called degree-magic if it admits a labelling of the edges by integers {1, 2, …, |E(G)|}… read more here.

Keywords: labeling disjoint; edge; graph; edge coloring ... See more keywords