Results 21 to 30 of about 9,423,140 (336)
Domination subdivision and domination multisubdivision numbers of graph [PDF]
Discussiones Mathematicae Graph Theory, 2019 12 pages, 2 ...
Jerzy Topp +2 more
openaire +3 more sources
Stability of Domination in Graphs
Ratio Mathematica, 2023 The stability of dominating sets in Graphs is introduced and studied, in this paper. Here D is a dominating set of Graph G. In this paper the vertices of D and vertices of $V - D$ are called donors and acceptors respectively.
Reeja Kuriakose, K. S Parvathy
doaj +1 more source
Graphs with equal domination and certified domination numbers [PDF]
Opuscula Mathematica, 2019 A set \(D\) of vertices of a graph \(G=(V_G,E_G)\) is a dominating set of \(G\) if every vertex in \(V_G-D\) is adjacent to at least one vertex in \(D\). The domination number (upper domination number, respectively) of \(G\), denoted by \(\gamma(G)\) (\(\Gamma(G)\), respectively), is the cardinality of a smallest (largest minimal, respectively ...
Magda Dettlaff +5 more
openaire +4 more sources
On domination multisubdivision number of unicyclic graphs [PDF]
Opuscula Mathematica, 2018 The paper continues the interesting study of the domination subdivision number and the domination multisubdivision number. On the basis of the constructive characterization of the trees with the domination subdivision number equal to 3 given in [H. Aram,
Joanna Raczek
doaj +1 more source
Characterization of outerplanar graphs with equal 2-domination and domination numbers
Theory and Applications of Graphs, 2022 A {\em $k$-domination number} of a graph $G$ is minimum cardinality of a $k$-dominating set of $G$, where a subset $S \subseteq V(G)$ is a {\em $k$-dominating set} if each vertex $v\in V(G)\setminus S$ is adjacent to at least $k$ vertices in $S$.
Naoki Matsumoto
doaj +1 more source
On the resolving strong domination number of graphs: a new notion
, 2021 The study of metric dimension of graph G has widely given some results and contribution of graph research of interest, including the domination set theory.
Dafik +4 more
semanticscholar +1 more source
A Note on the Paired-Domination Subdivision Number of Trees
Mathematics, 2021 For a graph G with no isolated vertex, let γpr(G) and sdγpr(G) denote the paired-domination and paired-domination subdivision numbers, respectively. In this note, we show that if T is a tree of order n≥4 different from a healthy spider (subdivided star),
Xiaoli Qiang +5 more
doaj +1 more source
On the Paired-Domination Subdivision Number of Trees
Mathematics, 2021 A paired-dominating set of a graph G without isolated vertices is a dominating set of vertices whose induced subgraph has perfect matching. The minimum cardinality of a paired-dominating set of G is called the paired-domination number γpr(G) of G.
Shouliu Wei +4 more
doaj +1 more source
On the edge geodetic and edge geodetic domination numbers of a graph [PDF]
Communications in Combinatorics and Optimization, 2020 In this paper, we study both concepts of geodetic dominating and edge geodetic dominating sets and derive some tight upper bounds on the edge geodetic and the edge geodetic domination numbers.
Vladimir Samodivkin
doaj +1 more source
Paired domination versus domination and packing number in graphs
Journal of Combinatorial Optimization, 2022 14 pages, 8 ...
Dettlaff, Magda +2 more
openaire +4 more sources