Results 1 to 10 of about 60,217 (209)
Finding Dominating Induced Matchings in P9-Free Graphs in Polynomial Time [PDF]
Discussiones Mathematicae Graph Theory, 2022 Let G = (V, E) be a finite undirected graph. An edge subset E′ ⊆ E is a dominating induced matching (d.i.m.) in G if every edge in E is intersected by exactly one edge of E′. The Dominating Induced Matching (DIM) problem asks for the existence of a d.i.m.
Brandstädt Andreas, Mosca Raffaele
doaj +15 more sources
On Minimum Maximal Distance-k Matchings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We study the computational complexity of several problems connected with finding a maximal distance-$k$ matching of minimum cardinality or minimum weight in a given graph. We introduce the class of $k$-equimatchable graphs which is an edge analogue of $k$
Yury Kartynnik, Andrew Ryzhikov
doaj +3 more sources
γ-paired dominating graphs of cycles [PDF]
Opuscula Mathematica, 2022 A paired dominating set of a graph \(G\) is a dominating set whose induced subgraph contains a perfect matching. The paired domination number, denoted by \(\gamma_{pr}(G)\), is the minimum cardinality of a paired dominating set of \(G\).
Pannawat Eakawinrujee +1 more
doaj +1 more source
Journal of New Theory, 2023 In this study, transformation graphs obtained from the concept of the total graph and the result of its paired domination number for some special graph families are discussed.
Hande Tunçel Gölpek
doaj +1 more source
Minimal Graphs with Disjoint Dominating and Paired-Dominating Sets
Discussiones Mathematicae Graph Theory, 2021 A subset D ⊆ VG is a dominating set of G if every vertex in VG – D has a neighbor in D, while D is a paired-dominating set of G if D is a dominating set and the subgraph induced by D contains a perfect matching.
Henning Michael A., Topp Jerzy
doaj +1 more source
On the Paired-Domination Subdivision Number of Trees
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 +4 more
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
Some Theoretical and Practical Results for Edge Dominating Set [PDF]
Engineering and Technology Journal, 2014 One of the most brilliant branches of modern mathematics and computer applications is graph theory. Graph domination problem has become an extremely important research branch of graph theory in recent times.
Nuha A. Rajab
doaj +1 more source
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
PLoS Genetics, 2022 Shaded plants challenged with herbivores or pathogens prioritize growth over defense. However, most experiments have focused on the effect of shading light cues on defense responses.
Anne-Sophie Fiorucci +6 more
doaj +1 more source