Name
Abstract | ||
|---|---|---|
A CNUC graph is one in which the union of any two closed neighborhoods of single vertices is a closed neighborhood of a single vertex. We show that every (finite, simple) graph is an induced subgraph of a CNUC graph. This paper provides the definition of the cnuc number of a graph, the minimum number of vertices that must be added in order to embed the graph as an induced subgraph of a CNUC graph. This number is determined or estimated for several classes of graphs. |
Year | Venue | DocType |
|---|---|---|
2020 | AUSTRALASIAN JOURNAL OF COMBINATORICS | Journal |
Volume | ISSN | Citations |
77 | 2202-3518 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kelly Guest | 1 | 0 | 0.34 |
| Sarah Holliday | 2 | 0 | 0.34 |
| Peter Johnson | 3 | 0 | 0.34 |
| Dieter Rautenbach | 4 | 946 | 138.87 |
| Matthew Walsh | 5 | 0 | 0.34 |