Results 81 to 90 of about 9,718,887 (99)
DOUBLY CONNECTED EDGE DOMINATION NUMBER OF A GRAPH
Advances and Applications in Discrete Mathematics, 2015 A set F of a graph is an edge dominating set if every edge in is adjacent to some edge in F. An edge domination number of G is the minimum cardinality of an edge dominating set. An edge dominating set F is called a doubly connected edge dominating set if the induced subgraphs and are connected.
Anupama, S.B. +2 more
openaire +3 more sources
On graphs for which the connected domination number is at most the total domination number [PDF]
Discrete Applied Mathematics, 2012 In this note, we give a finite forbidden subgraph characterization of the connected graphs for which any non-trivial connected induced subgraph has the property that the connected domination number is at most the total domination number. This question is
Oliver Schaudt
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
ON DOUBLY CONNECTED DOMINATION NUMBER OF SOME SPECIAL GRAPHS
Advances and Applications in Discrete MathematicsSherihatha R. Ahamad +2 more
openaire +1 more source
Bounds on the connected domination number of a graph
Discrete Applied Mathematics, 2013Michael Henning +2 more
exaly
Algorithmic complexity of secure connected domination in graphs
AKCE International Journal of Graphs and Combinatorics, 2020Jakkepalli Pavan Kumar +2 more
exaly
Total outer-connected domination numbers of trees
Discrete Applied Mathematics, 2009Joanna Cyman, Joanna Raczek
exaly
Bounds on the connected k-domination number in graphs
Discrete Applied Mathematics, 2010Adriana Hansberg
exaly
Connected dominating sets and connected domination polynomials of square of centipedes
Journal of Information and Optimization Sciences, 2016A Vijayan
exaly
On graphs with equal total domination and connected domination numbers
Applied Mathematics Letters, 2006Xuegang Chen
exaly