Name
Abstract | ||
|---|---|---|
The concept of the (integral) sum graphs was introduced by Harary (Congr. Numer. 72 (1990) 101; Discrete Math. 124 (1994) 99). Let N(Z) denote the set of all positive integers(integers). The (integral) sum graph of a finite subset S⊂N(Z) is the graph (S,E) with two vertices that are adjacent whenever their sum is in S. A graph G is said to be a (integral) sum graph if it is isomorphic to the (integral) sum graph of some S⊂Z. The (integral) sum number of a given graph G, denoted by σ(G)(ζ(G)), was defined as the smallest number of isolated vertices which when added to G resulted in a (integral) sum graph. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0012-365X(01)00218-7 | Discrete Mathematics |
Keywords | DocType | Volume |
Sum graph,Integral sum graph,Sum number,Integral sum number | Journal | 243 |
Issue | ISSN | Citations |
1 | 0012-365X | 0 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenjie He | 1 | 328 | 24.55 |
| Xinkai Yu | 2 | 2 | 1.41 |
| Honghai Mi | 3 | 0 | 2.03 |
| Yong Xu | 4 | 0 | 0.34 |
| Yufa Sheng | 5 | 0 | 0.34 |
| Lixin Wang | 6 | 0 | 0.34 |