Results 31 to 40 of about 398,878 (275)
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
Total dominator color class total dominating sets in ladder and mobius ladder graph
Malaya Journal of Matematik, 2021 Let $G$ be a finite, undirected and connected graph with minimum degree at least one. 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 class in $\mathcal{C}$ and each color class in $\mathcal{C}$ is properly dominated by a vertex in $\mathrm{V ...
null A. Vijayalekshmi, null S. Abisha
openaire +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
Complementary total domination in graphs [PDF]
, 2007 Let D be a minimum total dominating set of G. If V−D contains a total dominating set (TDS) say S of G, then S is called a complementary total dominating set with respect to D.
Chaluvaraju, B., Soner, N.D.
core +1 more source
Total Domishold Graphs: a Generalization of Threshold Graphs, with Connections to Threshold Hypergraphs [PDF]
, 2013 A total dominating set in a graph is a set of vertices such that every vertex of the graph has a neighbor in the set. We introduce and study graphs that admit non-negative real weights associated to their vertices such that a set of vertices is a total ...
Chiarelli, Nina, Milanic, Martin
core +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.
Henning, Michael A. +3 more
openaire +2 more sources
Fair Total Domination Number in Cactus Graphs
Discussiones Mathematicae Graph Theory, 2021 For k ≥ 1, a k-fair total dominating set (or just kFTD-set) in a graph G is a total dominating set S such that |N(v) ∩ S| = k for every vertex v ∈ V\S. The k-fair total domination number of G, denoted by ftdk(G), is the minimum cardinality of a kFTD-set.
Hajian Majid, Rad Nader Jafari
doaj +1 more source
Total Dominating Sets and Total Domination Polynomials of Square Of Paths
IOSR Journal of Mathematics, 2014 Let G= ( V , E ) be a simple connected graph. A set S V is a total dominating set of G if every vertex is adjacent to an element of S. Let Dt(Wn ,i) be the family of all total dominating sets of the graph Wn , n ≥ 3 with cardinality i, and let dt (Wn ,i) = │Dt (Wn 2 , i) │. In this paper we compute dt(Wn ,i),and obtain the polynomial Dt(Wn , x) = dt(Wn
T. Premala, C. Sekar
openaire +1 more source
Study on a Strong and Weak n-Connected Total Perfect k-Dominating set in Fuzzy Graphs
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 +1 more source
Secure total domination in chain graphs and cographs
AKCE International Journal of Graphs and Combinatorics, 2020 Let G = (V,E) be a graph without isolated vertices. A subset D of vertices of G is called a total dominating set of G if for every there exists a vertex such that A total dominating set D of a graph G is called a secure total dominating set of G if for ...
Anupriya Jha
doaj +1 more source