Results 11 to 20 of about 9,666,055 (254)

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   +2 more sources

Connected cototal domination number of a graph [PDF]

Transactions on Combinatorics, 2012
A dominating set $D subseteq V$ of a graph $G = (V,E)$ is said to be a connected cototal dominating set if $langle D rangle$ is connected and $langle V-D rangle neq phi$, contains no isolated vertices.
B Basavanagoud, Sunilkumar M Hosamani
doaj   +1 more source

Connected power domination number of product graphs [PDF]

, 2022
In this paper, we consider the connected power domination number ($\gamma_{P, c}$) of three standard graph products. The exact value for $\gamma_{P, c}(G\circ H)$ is obtained for any two non-trivial graphs $G$ and $H.$ Further, tight upper bounds are ...
Ganesamurthy, S., Srimathi, R., Jeyaranjan, J.   +2 more
core   +1 more source

Triple Connected Domination Number of a Graph [PDF]

, 2012
The concept of triple connected graphs with real life application was introduced by considering the existence of a path containing any three vertices of a graph G.
Selvam Avadayappan, T.Subramanian, Joseph, Paulraj, J.Paulraj Joseph, G.Mahadevan, Avadayappan, Selvam, Subramanian, T., Mahadevan, G.   +7 more
core   +1 more source

The Forcing Domination Number of Hamiltonian Cubic Graphs [PDF]

, 2009
The authors presented a sequence of Hamiltonian cubic graphs whose domination numbers are sharp and in this paper we study forcing domination number for those ...
H. Abdollahzadeh Ahangar, H.Abdollahzadeh Ahangar, Abdollahzadeh Ahangar, H., Pushpalatha L.   +3 more
core   +1 more source

Weakly connected domination stable trees [PDF]

, 1983
summary:A dominating set $D\subseteq V(G)$ is a {\it weakly connected dominating set} in $G$ if the subgraph $G[D]_w=(N_G[D],E_w)$ weakly induced by $D$ is connected, where $E_w$ is the set of all edges having at least one vertex in $D$.
Lemańska, Magdalena, Pattie Blitch, Sumner, David P, Blitch, Pattie, David P Sumner, Raczek, Joanna   +5 more
core   +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

Inequalities involving independence domination, $f$-domination, connected and total $f$-domination numbers [PDF]

, 1978
summary:Let $f$ be an integer-valued function defined on the vertex set $V(G)$ of a graph $G$. A subset $D$ of $V(G)$ is an $f$-dominating set if each vertex $x$ outside $D$ is adjacent to at least $f(x)$ vertices in $D$.
Allan, Robert B., Wei, Bing, Muthammai, S., Zhou, Sanming, Laskar, Renu, Janakiraman, T. N., Wang, Shaohui, Bhanumathi, M.   +7 more
core   +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, Nader Jafari Rad, Hailiza Kamarulhaili   +2 more
doaj   +1 more source

Computation of Various Domination Numbers of Rolf Nevanlinna (RNP) Collaboration Graph

Brazilian Archives of Biology and Technology, 2017
In this paper, we compute various Domination numbers like Outer Connected Domination (OCD), Doubly Connected Domination (DCD), Fair Domination (FD), Independence Domination (ID), 2-Packing (2-P) for Rolf Nevanlinna Prize Winners's Collaboration Graph ...
Yegnanarayanan V, Logeshwary B
doaj   +1 more source