Search

Showing total 1 results

Refine your results

1 results

1. An Improved Upper Bound on the Independent Domination Number in Cubic Graphs of Girth at Least Six.

Author

Abrishami, Gholamreza and Henning, Michael A.

Subjects
*MATHEMATICS, *CHARTS, diagrams, etc., *BIPARTITE graphs
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]

Published
2022
Full Text
View/download PDF