Name
Abstract | ||
|---|---|---|
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching. The paired-domination number gamma(pr)(G) is the minimum cardinality of a paired-dominating set of G. In this paper, we prove the conjecture of Goddard and Henning (2009) stating that if Gis a connected cubic graph of order nand Gis different from the Petersen graph, then gamma(pr)(G) <= 4n/7. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1016/j.disc.2022.113086 | DISCRETE MATHEMATICS |
Keywords | DocType | Volume |
Paired-domination number, Cubic graph | Journal | 345 |
Issue | ISSN | Citations |
12 | 0012-365X | 0 |
PageRank | References | Authors |
0.34 | 0 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. Kosari | 1 | 0 | 0.68 |
| Z. Shao | 2 | 0 | 0.34 |
| X. Shi | 3 | 0 | 0.34 |
| S. M. Sheikholeslami | 4 | 0 | 1.01 |
| M. Chellali | 5 | 0 | 1.01 |
| R. Khoeilar | 6 | 0 | 1.69 |
| H. Karami | 7 | 0 | 1.01 |