Name
Abstract | ||
|---|---|---|
While a finite, bipartite graph G can be k-graceful for every k ≥ 1, a finite nonbipartite G can be k-graceful for only finitely many values of k. An improved bound on such possible values of k is presented. Definitions are extended to infinite graphs, and it is shown that if G is locally finite and vertex set V(G) and edge set E(G) are countably infinite, then for each k ≥ 1 the graph G has a k-graceful numbering h mapping V(G) onto the set of nonnegative integers. |
Year | DOI | Venue |
|---|---|---|
1983 | 10.1016/0095-8956(83)90058-8 | Journal of Combinatorial Theory, Series B |
Field | DocType | Volume |
Integer,Numbering,Discrete mathematics,Graph,Combinatorics,Countable set,Bound graph,Vertex (geometry),Bipartite graph,Mathematics | Journal | 35 |
Issue | ISSN | Citations |
3 | 0095-8956 | 2 |
PageRank | References | Authors |
0.65 | 1 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter J. Slater | 1 | 593 | 132.02 |