Results 1 to 10 of about 11,901,808 (241)
Locating and total dominating sets in trees
Discrete Applied Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Teresa W. Haynes +2 more
openaire +3 more sources
Study on a Strong and Weak n-Connected Total Perfect k-Dominating set in Fuzzy Graphs [PDF]
Mathematics, 2022 In this paper, the concept of a strong n-Connected Total Perfect k-connected total perfect k-dominating set and a weak n-connected total perfect k-dominating set in fuzzy graphs is introduced.
Krishnasamy Elavarasan +3 more
doaj +2 more sources
An introduction of total dominator color class total dominating sets in graphs
Malaya Journal of Matematik, 2021 Let $G$ be a finite, undirected and connected graph with minimum degree at least one. In this paper we define a new graph parameter called total dominator color class total domination number of $G$. A proper coloring $\mathcal{C}$ of $G$ is said to be a total dominator color class total dominating set of $G$ if each vertex properly dominates a color ...
null A. Vijayalekshmi, null S. Abisha
openaire +1 more source
Bounds on the Locating-Total Domination Number in Trees
Discussiones Mathematicae Graph Theory, 2020 Given a graph G = (V, E) with no isolated vertex, a subset S of V is called a total dominating set of G if every vertex in V has a neighbor in S. A total dominating set S is called a locating-total dominating set if for each pair of distinct vertices u ...
Wang Kun, Ning Wenjie, Lu Mei
doaj +1 more source
Some results on domination in annihilating-ideal graphs of commutative rings [PDF]
Journal of Hyperstructures. Let R be a commutative ring with identity and A(R) be the set of all ideals of R with non-zero annihilators. The annihilating-ideal graph of R is defined as the graph AG(R) with the vertex set A∗(R) = A(R)\{(0)} and two distinct vertices I and J are ...
Reza Taheri
doaj +1 more source
Disjoint dominating and total dominating sets in graphs
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael A. Henning +3 more
openaire +2 more sources
On Two Open Problems on Double Vertex-Edge Domination in Graphs
Mathematics, 2019 A vertex v of a graph G = ( V , E ) , ve-dominates every edge incident to v, as well as every edge adjacent to these incident edges. A set S ⊆ V is a double vertex-edge dominating set if every edge of E is ve-dominated by at least two
Fang Miao +5 more
doaj +1 more source
Independent Transversal Total Domination Versus Total Domination in Trees
Discussiones Mathematicae Graph Theory, 2021 A subset of vertices in a graph G is a total dominating set if every vertex in G is adjacent to at least one vertex in this subset. The total domination number of G is the minimum cardinality of any total dominating set in G and is denoted by γt(G).
Martínez Abel Cabrera +2 more
doaj +1 more source
Total Italian domatic number of graphs [PDF]
Computer Science Journal of Moldova, 2023 Let $G$ be a graph with vertex set $V(G)$. An \textit{Italian dominating function} (IDF) on a graph $G$ is a function $f:V(G)\longrightarrow \{0,1,2\}$ such that every vertex $v$ with $f(v)=0$ is adjacent to a vertex $u$ with $f(u)=2$ or to two ...
Seyed Mahmoud Sheikholeslami +1 more
doaj +1 more source
A Note on the Locating-Total Domination in Graphs
Discussiones Mathematicae Graph Theory, 2017 In this paper we obtain a sharp (improved) lower bound on the locating-total domination number of a graph, and show that the decision problem for the locating-total domination is NP-complete.
Miller Mirka +4 more
doaj +1 more source