Results 81 to 90 of about 13,369 (211)
Total $k$-distance domination critical graphs [PDF]
Transactions on Combinatorics, 2016 A set $S$ of vertices in a graph $G=(V,E)$ is called a total$k$-distance dominating set if every vertex in $V$ is withindistance $k$ of a vertex in $S$.
Doost Ali Mojdeh +3 more
doaj
Total restrained domination in trees
Discrete Mathematics, 2007 AbstractLet G=(V,E) be a graph. A set S⊆V is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex of V-S is adjacent to a vertex in V-S. The total restrained domination number of G, denoted by γtr(G), is the smallest cardinality of a total restrained dominating set of G. We show that if T is a tree of order n,
Elizabeth Jonck +3 more
openaire +2 more sources
Total Roman Domination Edge-Supercritical and Edge-Removal-Supercritical Graphs [PDF]
, 2022 Christina M. Mynhardt, S. E. A. Ogden
openalex +1 more source
Equitable power domination number of total graph of certain graphs
, 2020 S. Banu Priya, A. Parthiban, P. Abirami
openalex +1 more source
Partial Total Domination in Hypergraphs
MathematicsThis paper establishes fundamental results for partial total domination in hypergraphs. We present tight bounds for the partial total domination number in k-uniform hypergraphs, demonstrate relationships with classical domination parameters, and provide ...
Abdulkafi Sanad, Chaoqian Li
doaj +1 more source
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2015 Let G = (V;E) be a graph. A set S ⊂ V (G) is a hop dominating set of G if for every v ∈ V - S, there exists u ∈ S such that d(u; v) = 2. The minimum cardinality of a hop dominating set of G is called a hop domination number of G and is denoted by γh(G ...
Natarajan C., Ayyaswamy S.K.
doaj +1 more source
Characterization of Cubic Graphs G with irt(G) = Irt(G) = 2
Discussiones Mathematicae Graph Theory, 2014 A subset S of vertices in a graph G is called a total irredundant set if, for each vertex v in G, v or one of its neighbors has no neighbor in S −{v}. The total irredundance number, ir(G), is the minimum cardinality of a maximal total irredundant set of ...
Eslahchi Changiz +2 more
doaj +1 more source
On the Outer Independent Total Double Roman Domination in Graphs [PDF]
, 2023 H. Abdollahzadeh Ahangar +3 more
openalex +1 more source
Signed total strong Roman domination in graphs [PDF]
Discrete Mathematics Letters, 2022 Maryam Hajjari +1 more
doaj +1 more source
3-Tuple Total Domination Number of Rook’s Graphs
, 2022 Behnaz Pahlavsay +2 more
openalex +2 more sources