Results 11 to 20 of about 3,784 (106)
On the Paired-Domination Subdivision Number of Trees [PDF]
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 +2 more
exaly +4 more sources
On the Paired-Domination Subdivision Number of a Graph [PDF]
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 +2 more
exaly +4 more sources
A Note on the Paired-Domination Subdivision Number of Trees [PDF]
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 +2 more
exaly +4 more sources
Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs [PDF]
Opuscula Mathematica, 2016 Given a graph \(G=(V,E)\), the subdivision of an edge \(e=uv\in E(G)\) means the substitution of the edge \(e\) by a vertex \(x\) and the new edges \(ux\) and \(xv\).
Magda Dettlaff +2 more
doaj +1 more source
Block Graphs with Large Paired Domination Multisubdivision Number
Discussiones Mathematicae Graph Theory, 2021 The paired domination multisubdivision number of a nonempty graph G, denoted by msdpr(G), is the smallest positive integer k such that there exists an edge which must be subdivided k times to increase the paired domination number of G.
Mynhardt Christina M., Raczek Joanna
doaj +1 more source
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
Trees whose 2-domination subdivision number is 2 [PDF]
, 2012 A set \(S\) of vertices in a graph \(G = (V,E)\) is a \(2\)-dominating set if every vertex of \(V\setminus S\) is adjacent to at least two vertices of \(S\). The \(2\)-domination number of a graph \(G\), denoted by \(\gamma_2(G)\), is the minimum size of
Abdollah Khodkar +2 more
core +1 more source
Paired-domination in inflated graphs [PDF]
, 2014 2003-2004 > Academic research: refereed > Publication in refereed journalAccepted ...
Cheng, TCE, Kang, L, Sohn, MY
core +1 more source
Katrina\u27s Lament: Reconstructing Federalism [PDF]
, 2006 The subject of stormwater management raises threshold questions about the federal system. Is the regulation of stormwater runoff and the environmental pollution it causes within the federal government\u27s legal jurisdiction?
Nolon, John R.
core +3 more sources
First impressions : Henry George Ward's Mexico in 1827 [PDF]
, 2017 Henry George Ward's Mexico in 1827 (published in 1828) is one of the most exhaustive accounts of Mexico and its mining activities in the years following its independence from Spain.
Fowler, Will
core +1 more source