Results 31 to 40 of about 232,724 (277)
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
The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
, 2014 Let $G$ be a connected non-bipartite graph on $n$ vertices with domination number $\gamma \le \frac{n+1}{3}$. We investigate the least eigenvalue of the signless Laplacian of $G$, and present a lower bound for such eigenvalue in terms of the domination ...
Fan, Yi-Zheng, Tan, Ying-Ying
core +1 more source
Inequalities involving independence domination, f-domination, connected and total f-domination numbers [PDF]
Czechoslovak Mathematical Journal, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
[1,2]-Complementary connected domination number of graphs-III
Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics, 2019 \(S\subset V(G)\) is a $[1,2]$-complementary connected dominating set of a graph \(G\) if each \(v\in V(G)\setminus S\) has one or two neighbors in \(S\) and \(G\setminus S\) is connected. The paper discusses cubic graphs of order \(12\) whose smallest $ [1,2]$-complementary connected dominating sets have cardinality \(3\).
Mahadevan, G., Renuka, K.
openaire +4 more sources
Alternative Domination in Graphs
AKCE International Journal of Graphs and CombinatoricsSometimes 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
Forcing Parameters in Fully Connected Cubic Networks
Mathematics, 2022 Domination in graphs has been extensively studied and adopted in many real life applications. The monitoring electrical power system is a variant of a domination problem called power domination problem.
Yongsheng Rao +4 more
doaj +1 more source
Weakly connected domination subdivision numbers
Discussiones Mathematicae Graph Theory, 2008 A set D of vertices in a graph G = (V, E) is a weakly connected dominating set of G if D is dominating in G and the subgraph weakly induced by D is connected. The weakly connected domination number of G is the minimum cardinality of a weakly connected dominating set of G.
openaire +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
Upper bounds for domination related parameters in graphs on surfaces
AKCE International Journal of Graphs and Combinatorics, 2016 In this paper we give tight upper bounds on the total domination number, the weakly connected domination number and the connected domination number of a graph in terms of order and Euler characteristic.
Vladimir Samodivkin
doaj +1 more source
Total mixed domination in graphs
AKCE International Journal of Graphs and Combinatorics, 2022 For a graph [Formula: see text] we call a subset [Formula: see text] a total mixed dominating set of G if each element of [Formula: see text] is either adjacent or incident to an element of S, and the total mixed domination number of G is the minimum ...
Adel P. Kazemi +2 more
doaj +1 more source