Results 41 to 50 of about 9,933,640 (289)

Singed Total Domatic Number of a Graph [PDF]

, 2010
The maximum number of functions in a signed total dominating family on G is the signed total domatic number of G. In this paper, some properties related signed total domatic number and signed total domination number of a graph are studied and found the ...
Shailaja S. Shirkol, Walikar, H.B., Kishori P.Narayankar   +2 more
core   +1 more source

Nonsplit Neighbourhood Tree Domination Number In Connected Graphs

, 2021
: Let G = (V, E) be a connected graph. A subset D of V is called a dominating set of G if N[D] = V. The minimum cardinality of a dominating set of G is called the domination number of G and is denoted by g(G).
et. al., S. Muthammai,
core   +1 more source

Algorithmic approach, mathematical modelling and network applications of connected certified domination in graphs: A comprehensive review [PDF]

EPJ Web of Conferences
In this study we have reviewed a very important variant of graph domination theory that is connected certified domination (CCD) and also presents CCD as graph-based model for network optimization.
Nehe Reshma, Menon Radhika, Goswami Vishwajeet   +2 more
doaj   +1 more source

The Forcing Geodetic Cototal Domination Number of a Graph

Ratio Mathematica, 2022
Let  be a geodetic cototal domination set of . A subset  is called a forcing subset for  if  is the unique minimum geodetic cototal domination set containing . The minimum cardinality T is the forcing geodetic cototal domination number of S is denotedby ,
S L Sumi, V Mary Gleeta, J Befija Minnie
doaj   +1 more source

Connected Certified Domination In The Middle Graph Of Certain Graphs [PDF]

, 2023
A dominating set S of a graph  is called a certified dominating set of G. If every vertices in S has either zero or at least two neighbours in  A certified dominating set S of G is said to be connected certified dominating set if the subgraph ...
R. Aneesh, Dr. M. Deva Saroja
core   +1 more source

Alternative Domination in Graphs

AKCE International Journal of Graphs and Combinatorics
Sometimes while you are using the Internet, for example, via a Wi-Fi network from one of the companies, the Internet is suddenly cut off due to a malfunction at that point, which disrupts your important work on the Internet, so there is a need for ...
Ali Mohammed Sahal
doaj   +1 more source

The Number of Minimum Dominating Sets in Pn × P2 [PDF]

, 2010
A set S of vertices in a graph G is said to be a Smarandachely k-dominating set if each vertex of G is dominated by at least k vertices of S.
Kishori P. Narayankar, Shirakol, Shailaja S., Shailaja S. Shirakol, H.B.Walikar, Narayankar, Kishori P., H. B. Walikar   +5 more
core   +1 more source

Weakly convex and convex domination numbers [PDF]

Opuscula Mathematica, 2004
Two new domination parameters for a connected graph \(G\): the weakly convex domination number of \(G\) and the convex domination number of \(G\) are introduced. Relations between these parameters and the other domination parameters are derived.
Magdalena Lemańska
doaj  

On connected k-domination numbers of graphs

Discrete Mathematics, 2004
A subset \(D\) of the vertex set \(V\) of a graph \(G\) is called a connected \(k\)-dominating set (for a positive integer \(k)\) in \(G\), if for each vertex \(x\in V-D\) there exists a vertex \(y\in D\) such that the distance between \(x\) and \(y\) in \(G\) is at most \(k\) and moreover the subgraph \(G[D]\) of \(G\) induced by \(D\) is conneced ...
openaire   +1 more source

Bounds relating the weakly connected domination number to the total domination number and the matching number

Discrete Applied Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Johannes H. Hattingh, Michael A. Henning
openaire   +3 more sources