Integral Sum Numbers of Graphs

Sheng Chyang Liaw, David Kuo, Gerard J. Chang

研究成果: 雜誌貢獻期刊論文同行評審

19 引文 斯高帕斯(Scopus)

摘要

The sum graph of a set S of positive integers is the graph G+(S) having S as its vertex set, with two distinct vertices adjacent whenever their sum is in S. If S is allowed to be a subset of all integers, a graph so obtained is called an integral sum graph. The integral sum number of a given graph G is the smallest number of isolated vertices which when added to G result in an integral sum graph. In this paper, we find the integral sum numbers of caterpillars, cycles, wheels, and complete bipartite graphs.

原文???core.languages.en_GB???
頁(從 - 到)259-268
頁數10
期刊Ars Combinatoria
54
出版狀態已出版 - 1月 2000

指紋

深入研究「Integral Sum Numbers of Graphs」主題。共同形成了獨特的指紋。

引用此