On integral sum graphs with a saturated vertex
Zhibo Chen (2010)
Czechoslovak Mathematical Journal
Similarity:
As introduced by F. Harary in 1994, a graph is said to be an if its vertices can be given a labeling with distinct integers so that for any two distinct vertices and of , is an edge of if and only if for some vertex in . We prove that every integral sum graph with a saturated vertex, except the complete graph , has edge-chromatic number equal to its maximum degree. (A vertex of a graph is said to be if it is adjacent to every...