Results 31 to 40 of about 9,063,667 (65)
Equality of Domination Number and Isolate Domination Number in Some Graphs [PDF]
, 2020 In this paper, the equality and strong equality properties among domination number, total domination number and isolate domination number are studied.
Min Min Maung, Lay Lay Nwe
core
On the equality of domination number and 2-domination number [PDF]
The $2$-domination number $gamma_2(G)$ of a graph $G$ is the minimum cardinality of a set $D subseteq V(G)$ for which every vertex outside $D$ is adjacent to at least two vertices in ▫$D$▫.
Gülnaz, Boruzanli Ekinci +1 more
core +2 more sources
On graphs for which the connected domination number is at most the total domination number. Discrete [PDF]
, 2012 In this note we give a finite forbidden subgraph characterization of the connected graphs for which any non-trivial connected induced subgraph has the property that the connected domination number is at most the total domination number.
Oliver Schaudt
core
On the (2,2)-domination number of trees [PDF]
, 2010 Let γ(G) and $γ_{2,2}(G)$ denote the domination number and (2,2)-domination number of a graph G, respectively. In this paper, for any nontrivial tree T, we show that $(2(γ(T)+1))/3 ≤ γ_{2,2}(T) ≤ 2γ(T)$.
Hou, Xinmin, Xu, Jun-Ming, Lu, You
core +1 more source
When the connected domination number is at most the total domination number [PDF]
, 2011 In this note we give a finite forbidden subgraph characterization of the connected graphs for which any non-trivial connected induced subgraph has the property that the connected domination number is at most the total domination number.
Schaudt, Oliver
core
Variants of the Domination Number for Flower Snarks [PDF]
, 2023 We consider the flower snarks, a widely studied infinite family of 3--regular graphs. For the Flower snark $J_n$ on $4n$ vertices, it is trivial to show that the domination number of $J_n$ is equal to $n$. However, results are more difficult to determine
Burdett, Ryan +2 more
core
Characterization of block graphs with equal 2-domination number and domination number plus one [PDF]
, 2007 Let G be a simple graph, and let p be a positive integer. A subset D ⊆ V(G) is a p-dominating set of the graph G, if every vertex v ∈ V(G)-D is adjacent with at least p vertices of D.
Hansberg, Adriana +2 more
core +1 more source
Domination in graphs with few edges [PDF]
, 1995 summary:The domination number $\g(G)$ of a graph $G$ and two its variants are considered, namely the signed domination number $\g_s (G)$ and the minus domination number $\g^-(G)$. These numerical invariants are compared for graphs in which the degrees of
Zelinka, Bohdan
core +1 more source
Complete Cototal Domination Number of a Graph
, 2011 Let be a graph. A set of a graph is called a total dominating set if the induced subgraph has no isolated vertices. The total domination number of G is the minimum cardinality of a total dominating set of G.
B. Basavanagoud, S. M. Hosamani
core +1 more source
Unique Metro Domination Number of Circulant Graphs [PDF]
, 2019 In this paper, we determine unique metro domination number of circulant ...
John Sherra, B. Sooryanarayana
core +1 more source