Back to Search
Start Over
An Improved Upper Bound on the Independent Domination Number in Cubic Graphs of Girth at Least Six.
- Source :
-
Graphs & Combinatorics . Apr2022, Vol. 38 Issue 2, p1-12. 12p. - Publication Year :
- 2022
-
Abstract
- Henning et al. (Discrete Appl Math 162:399–403, 2014) proved that if G is a bipartite, cubic graph of order n and of girth at least 6, then i (G) ≤ 4 11 n . In this paper, we improve the 4 11 -bound to a 5 14 -bound, and prove that if G is a bipartite, cubic graph of order n and of girth at least 6, then i (G) ≤ 5 14 n . [ABSTRACT FROM AUTHOR]
- Subjects :
- *MATHEMATICS
*CHARTS, diagrams, etc.
*BIPARTITE graphs
Subjects
Details
- Language :
- English
- ISSN :
- 09110119
- Volume :
- 38
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Graphs & Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 154994845
- Full Text :
- https://doi.org/10.1007/s00373-021-02446-y