Results 271 to 280 of about 1,217,256 (282)

Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected

Discrete Mathematics, 2022
Petr Vrana
exaly  

Bounds on the connected domination number of a graph

Discrete Applied Mathematics, 2013
Michael Henning, Teresa Haynes, Wyatt J Desormeaux   +2 more
exaly  

Bounds on the connected k-domination number in graphs

Discrete Applied Mathematics, 2010
Adriana Hansberg
exaly  

Roman Domination on 2-Connected Graphs

SIAM Journal on Discrete Mathematics, 2012
Chun-Hung Liu, Gérard Jennhwa Chang
exaly  

Codiameters of 3-connected 3-domination critical graphs

Journal of Graph Theory, 2002
Yaojun Chen
exaly  

Chromatic connected domination in graphs

Journal of Discrete Mathematical Sciences and Cryptography, 2019
M Anitha
exaly  

Connected Domination Stable Graphs Upon Edge Addition

Quaestiones Mathematicae, 2015
Teresa Haynes
exaly  

On the forcing connected domination number of a graph

Journal of Discrete Mathematical Sciences and Cryptography, 2017
exaly  

An upper bound on the domination number of n-vertex connected cubic graphs

Discrete Mathematics, 2009
A V Kostochka
exaly  

Connected Dominating Set

2008
Xiuzhen Cheng, Feng Wang, Ding-Zhu Du
openaire   +1 more source