Results 31 to 40 of about 9,917,456 (366)
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
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
On the out-domination and in-domination numbers of a digraph
Discrete Mathematics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frank Harary +2 more
openaire +2 more sources
Resolving independent domination number of some special graphs
, 2021 Dominating set is a set D of vertices of graph G(V, E) and every vertex u ∈ V(G) − D is adjacent to some vertex υ ∈ D. The set D is called independent set if no two vertices in D are adjacent. Independent domination number of G is the minimum cardinality
T. Mazidah +4 more
semanticscholar +1 more source
Domination and Power Domination in Certain Families of Nanostars Dendrimers
IEEE Access, 2020 Dendrimers are hyper-branched macromolecules having various applications in diverse fields like supra-molecular chemistry, drug delivery and nanotechnology etc.
Tanveer Iqbal +2 more
doaj +1 more source
The domination number of on-line social networks and random geometric graphs [PDF]
, 2014 We consider the domination number for on-line social networks, both in a stochastic network model, and for real-world, networked data. Asymptotic sublinear bounds are rigorously derived for the domination number of graphs generated by the memoryless ...
Bonato, Anthony +4 more
core +4 more sources
On domination and independent domination numbers of a graph
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
Renu C. Laskar, Robert B. Allan
openaire +2 more sources
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
Domination parameters with number 2: Interrelations and algorithmic consequences [PDF]
, 2018 In this paper, we study the most basic domination invariants in graphs, in which number 2 is intrinsic part of their definitions. We classify them upon three criteria, two of which give the following previously studied invariants: the weak 2-domination ...
Bonomo, Flavia +4 more
core +2 more sources