RO EN
Connected Domination Number and a New Invariant in Graphs with Independence Number Three
Authors: Vladimir Bercov
Keywords: dominating set, number of Hadwiger, clique number, independence number.
– 0.14 Mb
Keywords: dominating set, number of Hadwiger, clique number, independence number.
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$.Department of Mathematics
CUNY Borough of Manhattan Community College
199 Chambers St, New York, NY 10007, USA
E-mail:
CUNY Borough of Manhattan Community College
199 Chambers St, New York, NY 10007, USA
E-mail:
Fulltext
– 0.14 Mb
Contents
- A Sublinear Sudoku Solution in cP Systems and its Formal Verification
- On a modified M/M/m/n queueing model
- Properties of Finitely Supported Self - Mappings on the Finite Powerset of Atoms
- On the bondage, strong and weak bondage numbers in Complementary Prism Graphs
- Some properties of maximum deficiency energy of a graph
- Connected Domination Number and a New Invariant in Graphs with Independence Number Three
- Total energy of signed digraphs
- Backtracking algorithm for lexicon generation
