Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Liaw, SC | en_US |
dc.contributor.author | Kuo, D | en_US |
dc.contributor.author | Chang, GJ | en_US |
dc.date.accessioned | 2014-12-08T15:45:54Z | - |
dc.date.available | 2014-12-08T15:45:54Z | - |
dc.date.issued | 2000-01-01 | en_US |
dc.identifier.issn | 0381-7032 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/30868 | - |
dc.description.abstract | 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. | en_US |
dc.language.iso | en_US | en_US |
dc.title | Integral sum numbers of graphs | en_US |
dc.type | Article | en_US |
dc.identifier.journal | ARS COMBINATORIA | en_US |
dc.citation.volume | 54 | en_US |
dc.citation.issue | en_US | |
dc.citation.spage | 259 | en_US |
dc.citation.epage | 268 | en_US |
dc.contributor.department | 應用數學系 | zh_TW |
dc.contributor.department | Department of Applied Mathematics | en_US |
dc.identifier.wosnumber | WOS:000085703600019 | - |
dc.citation.woscount | 12 | - |
Appears in Collections: | Articles |