Name
Title | ||
|---|---|---|
Note on the domination number of graphs with forbidden cycles of lengths not divisible by 3 |
Abstract | ||
|---|---|---|
In this note, we prove that the domination number of a graph of order n and minimum degree at least 2 that does not contain cycles of length 3r + 2, where 1 <= r <= k, and cycles of length 3r + 1 for 1 <= r <= 2k + 2, is at most k+2/3k +5n. This improves some previous results. |
Year | Venue | DocType |
|---|---|---|
2022 | AUSTRALASIAN JOURNAL OF COMBINATORICS | Journal |
Volume | ISSN | Citations |
83 | 2202-3518 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. Khoeilar | 1 | 0 | 1.69 |
| H. Karami | 2 | 0 | 1.01 |
| M. Chellali | 3 | 0 | 1.01 |
| S. M. Sheikholeslami | 4 | 0 | 1.01 |