Results 21 to 30 of about 4,392 (255)
On the doubly connected domination number of a graph [PDF]
Open Mathematics, 2006 Abstract For a given connected graph G = (V, E), a set $$D \subseteq V(G)$$ is a doubly connected dominating set if it is dominating and both 〈D〉 and 〈V (G)-D〉 are connected. The cardinality of the minimum doubly connected dominating set in G is the doubly connected domination number.
Cyman Joanna +2 more
doaj +2 more sources
Perfect edge domination in vague graphs
Ratio Mathematica, 2021 In this paper, we modified undirected vague graphs and edge domination set based on these two concepts. We study the notions of perfect edge domination, connected perfect edge domination of vague graph. Moreover, we investigate some related properties in
M Kaliraja, P Kanibose, Abdul Ibrahim
doaj +1 more source
Connected End Anti-Fuzzy Equitable Dominating Set In Anti-Fuzzy Graphs
Ratio Mathematica, 2023 In this paper, the notion of connected end anti-fuzzy equitable dominating set of an anti-fuzzy graph is discussed. The connected end anti-fuzzy equitable domination number for some standard graphs are obtained.
Janofer K, S.Firthous Fatima
doaj +1 more source
Ratio Mathematica, 2022 Let be a simple graph.Let be the family of connected 2 dominating sets in with cardinality and |.Then the polynomial is called the 2 domination polynomial of where is the connected 2 domination number of Let be the family of connected 2 dominating ...
Y.A. Shiny, Anithababy T
doaj +1 more source
Some results on the independence number of connected domination critical graphs
AKCE International Journal of Graphs and Combinatorics, 2018 A --critical graph is a graph with connected domination number and for any pair of non-adjacent vertices and of . Let and be respectively the clique number and the independence number of a graph.
P. Kaemawichanurat, T. Jiarasuksakun
doaj +2 more sources
Total connected domination game [PDF]
Opuscula Mathematica, 2021 The (total) connected domination game on a graph \(G\) is played by two players, Dominator and Staller, according to the standard (total) domination game with the additional requirement that at each stage of the game the selected vertices induce a ...
Csilla Bujtás +3 more
doaj +1 more source
Connected Domination Number of a Graph and its Complement [PDF]
Graphs and Combinatorics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hossein Karami 0002 +3 more
openaire +1 more source
Neighbourhood total domination in graphs [PDF]
Opuscula Mathematica, 2011 Let \(G = (V,E)\) be a graph without isolated vertices. A dominating set \(S\) of \(G\) is called a neighbourhood total dominating set (ntd-set) if the induced subgraph \(\langle N(S)\rangle\) has no isolated vertices.
S. Arumugam, C. Sivagnanam
doaj +1 more source
Average distance and connected domination
AKCE International Journal of Graphs and Combinatorics, 2023 We give a tight upper bound on the average distance of a connected graph of given order in terms of its connected domination number. Our results are a strengthening of a result by DeLaViña, Pepper, and Waller [A note on dominating sets and average ...
P. Mafuta, S. Mukwembi
doaj +1 more source
On the domination of triangulated discs [PDF]
Mathematica Bohemica, 2023 Let $G$ be a $3$-connected triangulated disc of order $n$ with the boundary cycle $C$ of the outer face of $G$. Tokunaga (2013) conjectured that $G$ has a dominating set of cardinality at most $\frac14(n+2)$.
Noor A'lawiah Abd Aziz +2 more
doaj +1 more source