Results 31 to 40 of about 9,635,811 (355)
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
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
Edge-recognizable domination numbers
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dutton, Ronald D. +2 more
openaire +3 more sources
Domination cover number of graphs [PDF]
Discrete Mathematics, Algorithms and Applications, 2019 A set [Formula: see text] for the graph [Formula: see text] is called a dominating set if any vertex [Formula: see text] has at least one neighbor in [Formula: see text]. Fomin et al. [Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications, ACM Transactions on Algorithms (TALG) 5(1) (2008) 9] gave an algorithm ...
M. Alambardar Meybodi +3 more
openaire +2 more sources
Domination subdivision and domination multisubdivision numbers of graph
Discussiones Mathematicae Graph Theory, 2019 12 pages, 2 ...
Dettlaff Magda +2 more
openaire +4 more sources
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2015 Let G = (V;E) be a graph. A set S ⊂ V (G) is a hop dominating set of G if for every v ∈ V - S, there exists u ∈ S such that d(u; v) = 2. The minimum cardinality of a hop dominating set of G is called a hop domination number of G and is denoted by γh(G ...
Natarajan C., Ayyaswamy S.K.
doaj +1 more source
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a graph and let be a family of subsets of such that A dominating set of is called an -dominating set if for all The minimum cardinality of an -dominating of is called the -domination number of and is denoted by In this paper we present several ...
Manju Raju +3 more
doaj +1 more source
The geodetic domination number of comb product graphs
Electronic Journal of Graph Theory and Applications, 2020 A subset S of vertices in graph G is called a geodetic set if every vertex in V(G) \ S lies on a shortest path between two vertices in S. A subset S of vertices in G is called a dominating set if every vertex in V(G) \ S is adjacent to a vertex in S ...
Dimas Agus Fahrudin, Suhadi Wido Saputro
doaj +1 more source
All graphs with paired-domination number two less than their order [PDF]
Opuscula Mathematica, 2013 Let \(G=(V,E)\) be a graph with no isolated vertices. A set \(S\subseteq V\) is a paired-dominating set of \(G\) if every vertex not in \(S\) is adjacent with some vertex in \(S\) and the subgraph induced by \(S\) contains a perfect matching.
Włodzimierz Ulatowski
doaj +1 more source