Results 11 to 20 of about 8,731,938 (294)
On domination and independent domination numbers of a graph [PDF]
Discrete Mathematics, 1978 AbstractFor a graph G, the definitions of domination number, denoted γ(G), and independent domination number, denoted i(G), are given, and the following results are obtained:Theorem. If G does not have an induced subgraph isomorphic to K1,3, then γ(G) = i(G).Corollary 1. For any graph G, γ(L(G))=i(L(G)), where L(G) is the line graph of G. (This extends
Robert B. Allan, Renu C. Laskar
openaire +2 more sources
Discrete Mathematics, 2002 The dominating set of a digraph \(D\) is a set \(S\) of vertices such that for every \(v\not\in S\) there exists \(u\in S\) with \(uv\in A(D)\). The domination number of \(D\) is the cardinality of the smallest dominating set. The game domination number of an undirected graph \(G\) is the domination number of the digraph \(D\) obtained as a result of ...
Noga Alon +3 more
openaire +2 more sources
Anarchism and non-domination [PDF]
, 2019 In this article we recover the classical anarchist deployment of republican tropes of non-domination, tyranny and slavery, to expose the conservative limits of the contemporary neo-Roman republican revival. For the anarchists, the modern nation state and
WAL Prichard (21872402) +1 more
core +16 more sources
Bounds on the Locating-Domination Number and Differentiating-Total Domination Number in Trees
Discussiones Mathematicae Graph Theory, 2018 A subset S of vertices in a graph G = (V,E) is a dominating set of G if every vertex in V − S has a neighbor in S, and is a total dominating set if every vertex in V has a neighbor in S.
Rad Nader Jafari, Rahbani Hadi
doaj +2 more sources
Discussiones Mathematicae Graph Theory, 2014 Let K3n denote the Cartesian product Kn□Kn□Kn, where Kn is the complete graph on n vertices.
Georges John, Lin Jianwei, Mauro David
doaj +4 more sources
On the equality of domination number and 2-domination number
Discussiones Mathematicae Graph TheoryThe 2-domination number $γ_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 $. Clearly, $ γ_2(G) $ cannot be smaller than the domination number $ γ(G) $.
Gülnaz Boruzanlı Ekinci +1 more
doaj +5 more sources
On the out-domination and in-domination numbers of a digraph
Discrete Mathematics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gary Chartrand +2 more
openaire +3 more sources
The paired-domination and the upper paired-domination numbers of graphs [PDF]
Opuscula Mathematica, 2015 In this paper we continue the study of paired-domination in graphs. A paired-dominating set, abbreviated PDS, of a graph \(G\) with no isolated vertex is a dominating set of vertices whose induced subgraph has a perfect matching.
Włodzimierz Ulatowski
doaj +1 more source
On the Paired-Domination Subdivision Number of a Graph
Mathematics, 2021 In order to increase the paired-domination number of a graph G, the minimum number of edges that must be subdivided (where each edge in G can be subdivided no more than once) is called the paired-domination subdivision number sdγpr(G) of G.
Guoliang Hao +4 more
doaj +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 +7 more
core +1 more source