Back to Search Start Over

Connected Domination Number and a New Invariant in Graphs with Independence Number Three

Authors :
Vladimir Bercov
Source :
Computer Science Journal of Moldova, Vol 29, Iss 1(85), Pp 96-104 (2021)
Publication Year :
2021
Publisher :
Vladimir Andrunachievici Institute of Mathematics and Computer Science, 2021.

Abstract

Adding a connected dominating set of vertices to a graph $G$ increases its number of Hadwiger $h(G)$. Based on this obvious property in [2] we introduced a new invariant $\eta(G)$ for which $\eta(G)\leq h(G)$. We continue to study its property. For a graph $G$ with independence number three without induced chordless cycles $C_7$ and with $n(G)$ vertices, $\eta(G)\geq n(G)/4$.

Details

Language :
English
ISSN :
15614042
Volume :
29
Issue :
1(85)
Database :
Directory of Open Access Journals
Journal :
Computer Science Journal of Moldova
Publication Type :
Academic Journal
Accession number :
edsdoj.82a05894ab4448d39a0c7a88cadc5f95
Document Type :
article