Results 251 to 260 of about 369,294 (274)
Some of the next articles are maybe not open access.
2013
In this chapter we focus on the upper total domination number of a graph. Recall that the upper domination number of a graph G, denoted by Γ(G), is the maximum cardinality of a minimal dominating set in G, while the upper total domination number of G, denoted by Γ t (G), is the maximum cardinality of a minimal TD-set in G.
Michael A. Henning, Anders Yeo
openaire +1 more source
In this chapter we focus on the upper total domination number of a graph. Recall that the upper domination number of a graph G, denoted by Γ(G), is the maximum cardinality of a minimal dominating set in G, while the upper total domination number of G, denoted by Γ t (G), is the maximum cardinality of a minimal TD-set in G.
Michael A. Henning, Anders Yeo
openaire +1 more source
Total forcing versus total domination in cubic graphs
Applied Mathematics and Computation, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Randy Davila, Michael A. Henning
openaire +2 more sources
SUPERLATIVE TOTAL DOMINATION IN GRAPHS
Electronic Journal of Mathematical Analysis and ApplicationsSummary: Let \(G= (V, E)\) be a simple graph with no isolated vertices and \(p \geq 3\). A set \(D \subseteq V\) is a dominating set, abbreviated as DS, of a graph \(G\), if every vertex in \(V-D\) is adjacent to some vertex in \(D\), while a total dominating set, abbreviated as TDS, of \(G\) is a set \(T \subseteq V\) such that every vertex in \(G ...
Bankapur, Veena, Chaluvaraju, B.
openaire +1 more source
Total Dominator Total Chromatic Numbers of Some Graphs
Utilitas MathematicaTotal dominator total coloring of a graph is a total coloring of the graph such that each object of the graph is adjacent or incident to every object of some color class. The minimum namber of the color classes of a total dominator total coloring of a graph is called the total dominator total chromatic number of the graph.
Vusuqi, Leila +2 more
openaire +2 more sources
Total domination edge critical graphs
1998A subset \(D\) of the vertex set \(V(G)\) of a graph \(G\) is called total dominating in \(G\), if for each \(x\in V(G)\) there exists a vertex \(y\in D\) adjacent to \(x\). The minimum number of vertices of a total dominating set in \(G\) is the total domination number \(\gamma_t(G)\) of \(G\).
Van Der Merwe, L. C. +2 more
openaire +1 more source
Total Roman {2}-domination in graphs
Quaestiones Mathematicae, 2021Abel Cabrera Martínez +2 more
exaly
Domination in fuzzy graphs – I
Pattern Recognition Letters, 1998A Somasundaram, Somasundaram Subbarayan
exaly
Total domination in maximal outerplanar graphs
Discrete Applied Mathematics, 2017Elizabeth Jonck
exaly

