Results 61 to 70 of about 13,369 (211)
Total domination excellent trees
Discrete Mathematics, 2003 A set \(S\) of vertices of a graph \(G\) is a total dominating set if every vertex of \(G\) is adjacent to some vertex of \(S\) (other than itself). A graph is total domination excellent, denoted by \(\gamma_t\)-excellent, if every vertex belongs to some total dominating set of smallest cardinality.
openaire +2 more sources
On Total Domination and Minimum Maximal Matchings in Graphs [PDF]
, 2022 Selim Bahadır
openalex +1 more source
Disjoint dominating and total dominating sets in graphs
Discrete Applied Mathematics, 2010 AbstractIt has been shown [M.A. Henning, J. Southey, A note on graphs with disjoint dominating and total dominating sets, Ars Combin. 89 (2008) 159–162] that every connected graph with minimum degree at least two that is not a cycle on five vertices has a dominating set D and a total dominating set T which are disjoint.
Christian Löwenstein +3 more
openaire +2 more sources
Strong total domination and weak total domination in Mycielski's graphs [PDF]
Malaya Journal of Matematik, 2020 TUNÇEL GÖLPEK, HANDE, AYTAÇ, AYSUN
openaire +2 more sources
On weighted efficient total domination
Journal of Discrete Algorithms, 2012 AbstractAn efficiently total dominating set of a graph G is a subset of its vertices such that each vertex of G is adjacent to exactly one vertex of the subset. If there is such a subset, then G is an efficiently total dominable graph (G is etd).In this paper, we prove NP-completeness of the etd decision problem on the class of planar bipartite graphs ...
openaire +3 more sources
Total Domination in Unit Disk Graphs [PDF]
, 2022 Sangram K. Jena, Gautam K. Das
openalex +1 more source
Computing locating-total domination number in some rotationally symmetric graphs. [PDF]
Sci Prog, 2021 Raza H, Iqbal N, Khan H, Botmart T.
europepmc +1 more source
On the roots of total domination polynomial of graphs, II [PDF]
, 2022 Saeid Alikhani, Nasrin Jafari
openalex +1 more source
Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set [PDF]
Opuscula MathematicaA graph \(G\) whose vertex set can be partitioned into a total dominating set and an independent dominating set is called a TI-graph. We give constructions that yield infinite families of graphs that are TI-graphs, as well as constructions that yield ...
Teresa W. Haynes, Michael A. Henning
doaj +1 more source
On total domination and total equitable domination in graphs [PDF]
Malaya Journal of Matematik, 2018 S. K Vaidya, A. D Parmar
openaire +1 more source