Results 21 to 30 of about 9,718,887 (99)
On the doubly connected domination polynomial of a graph
Let [Formula: see text] be a simple graph. A set [Formula: see text] is a doubly connected dominating set of [Formula: see text] if it is a dominating set and both induced subgraphs [Formula: see text] and [Formula: see text] are connected.
M. Arslanov, F. Movahedi, M. H. Akhbari
core +1 more source
On the doubly connected domination polynomial of a graph [PDF]
© 2019 World Scientific Publishing Company Let (Formula presented.) be a simple graph. A set (Formula presented.) is a doubly connected dominating set of (Formula presented.) if it is a dominating set and both induced subgraphs (Formula presented.) and ...
core
Singed Total Domatic Number of a Graph [PDF]
The maximum number of functions in a signed total dominating family on G is the signed total domatic number of G. In this paper, some properties related signed total domatic number and signed total domination number of a graph are studied and found the ...
Shailaja S. Shirkol +2 more
core +1 more source
On the doubly connected domination polynomial of a graph
© 2019 World Scientific Publishing Company Let (Formula presented.) be a simple graph. A set (Formula presented.) is a doubly connected dominating set of (Formula presented.) if it is a dominating set and both induced subgraphs (Formula presented.) and ...
core
On Roman, Global and Restrained Domination in Graphs [PDF]
In this paper, we present new upper bounds for the global domination and Roman domination numbers and also prove that these results are asymptotically best possible.
Zverovich, Vadim +3 more
core +1 more source
When the connected domination number is at most the total domination number [PDF]
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.
Schaudt, Oliver
core +2 more sources
Connected domination number of graph [PDF]
V diplomskem delu je obravnavano povezano dominantno število grafa. Na začetku so podrobneje razloženi osnovni pojmi teorije grafov, ki so potrebni za razumevanje celotnega dela. V osrednjem delu so opisane lastnosti povezanega dominantnega števila grafa
Smej, Renato
core
Connected and outer-connected domination number of middle graphs
In this paper, we study the notions of connected domination number and of outer-connected domination number for middle graphs. Indeed, we obtain tight bounds for this number in terms of the order of the graph M(G).
Kazemnejad, Farshad +3 more
core
Inequalities of Nordhausgaddum type for doubly connected domination
1st Regional Conference on Applied and Engineering Mathematics (RCAEM-I) 2010 organized by Universiti Malaysia Perlis (UniMAP) and co-organized by Universiti Sains Malaysia (USM) & Universiti Kebangsaan Malaysia (UKM), 2nd - 3rd June 2010 at Eastern ...
Roslan, Hasni@Abdullah +2 more
core
Protomer Formation Can Aid the Structural Identification of Caffeine Metabolites. [PDF]
Sepman H +3 more
europepmc +1 more source

