Name
Abstract | ||
|---|---|---|
For any undirected graph G, let C(G) be the collection of edge-deleted subgraphs. It is always possible to construct a graph H from C(G) so that C(H)=C(G). The general edge-reconstruction conjecture states that G and H must be isomorphic if they have at least four edges. A graphical invariant that must be identical for all graphs that can be constructed from the given collection is said to be edge-recognizable. Here we show that the domination number and many of its common variations are edge-recognizable. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0012-365X(03)00183-3 | Discrete Mathematics |
Keywords | Field | DocType |
paired domination,edge-reconstruction,total domination,k-domination,distance- k domination,k -domination,distance-k domination,connected domination,domination number | Graph theory,Discrete mathematics,Graph,Combinatorics,Graph power,Isomorphism,Invariant (mathematics),Domination analysis,Connectivity,Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
272 | 1 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ronald D. Dutton | 1 | 190 | 27.80 |
| Robert C. Brigham | 2 | 157 | 26.74 |
| Chao Gui | 3 | 680 | 42.70 |