Results 231 to 240 of about 1,996 (260)
Graphs with maximum size and given paired-domination number
Discrete Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael A. Henning +2 more
openalex +2 more sources
Bounds on the locating - paired – Double domination number of graphs
AIP Conference Proceedings, 2023 Mauro Valli, V. Anusuya
openalex +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Upper Bounds for the Paired-Domination Numbers of Graphs
Graphs and Combinatorics, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Changhong Lu, Chao Wang, Kan Wang
openaire +1 more source
2-Distance paired-dominating number of graphs
Journal of Combinatorial Optimization, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kan Yu, Mei Lu
openaire +1 more source
Total and paired domination numbers of windmill graphs
Asian-European Journal of Mathematics, 2023Let [Formula: see text] be a graph without isolated vertices. A total dominating set of [Formula: see text] is a set [Formula: see text] of vertices of [Formula: see text] such that every vertex of [Formula: see text] is adjacent to at least one vertex in [Formula: see text].
Pannawat Eakawinrujee +1 more
openaire +1 more source
COMPLEMENTARY INDEPENDENT TWIN PAIRED DOMINATION NUMBER OF A GRAPH
Advances in Mathematics: Scientific Journal, 2020 M. Vimala Suganthi, G. Mahadevan
openalex +2 more sources
Paired-domination number of claw-free odd-regular graphs
Journal of Combinatorial Optimization, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wei Yang, Xinhui An, Baoyindureng Wu
openalex +2 more sources
A Characterization of Cubic Graphs with Paired-Domination Number Three-Fifths Their Order
Graphs and Combinatorics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wayne Goddard, Michael A. Henning
openalex +2 more sources
A characterization of trees with equal total domination and paired-domination numbers [PDF]
Australas. J Comb., 2004 Let \(G=(V,E)\) be a graph without isolated vertices. A set \(S\subseteq V\) is a total dominating set if every vertex of \(V\) is adjacent to at least one vertex in \(S\). A total dominating set \(S\subseteq V\) is a paired-dominating set if the induced subgraph \(G[S]\) has at least one perfect matching. The paired-domination number \(\gamma_{pr}(G)\)
Erfang Shan +2 more
openaire +1 more source
A New Characterization of Paired Domination Number of a Graph
, 2012 Paired domination is a relatively interesting concept introduced by Teresa W. Haynes [9] recently with the following application in mind. If we think of each vertex s ∈ S, as the location of a guard capable of protecting each vertex dominated by S, then for a paired domination the guards location must be selected as adjacent pairs of vertices so that ...
G. Mahadevan +3 more
openalex +2 more sources