Results 1 to 10 of about 488,070 (310)
New Algorithms for Mixed Dominating Set [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A mixed dominating set is a collection of vertices and edges that dominates all vertices and edges of a graph. We study the complexity of exact and parameterized algorithms for \textsc{Mixed Dominating Set}, resolving some open questions.
Louis Dublois +2 more
doaj +3 more sources
Closed neutrosophic dominating set in neutrosophic graphs [PDF]
Neutrosophic Sets and Systems, 2023 The aim of this article is to concentrate on the notion of closed neutrosophic domination (CND) number πΎππ (πΊ) of a neutrosophic graph (NG) with using effective edge, furthermore we gain a few outcomes on this notion, the relation between πΎππ (πΊ) and ...
Amir Majeed Nabeel Arif
doaj +2 more sources
Enumerating Minimal Connected Dominating Sets
SIAM Journal on Discrete Mathematics, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohamed Yosri Sayadi +4 more
openalex +4 more sources
Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set [PDF]
Opuscula MathematicaA graph \(G\) whose vertex set can be partitioned into a total dominating set and an independent dominating set is called a TI-graph. We give constructions that yield infinite families of graphs that are TI-graphs, as well as constructions that yield ...
Teresa W. Haynes, Michael A. Henning
doaj +2 more sources
Improved Location Estimation in Wireless Sensor Networks Using a Vector-Based Swarm Optimized Connected Dominating Set. [PDF]
Sensors (Basel), 2019 Kumar G +6 more
europepmc +3 more sources
Characterizing minimal point set dominating sets
AKCE International Journal of Graphs and Combinatorics, 2016 A set D of vertices in a graph G=(V,E) is said to be a point-set dominating set (or, in short, psd-set) of G if for every subset S of VβD there exists a vertex vβD such that the subgraph β©Sβͺ{v}βͺ is connected; the set of all psd-sets of G will be denoted ...
Purnima Gupta, Rajesh Singh, S. Arumugam
doaj +2 more sources
Efficient Domination In Fuzzy Graphs and Intuitionistic Fuzzy Graphs in Strong and weak forms [PDF]
E3S Web of Conferences, 2023 This work defines the concepts of strong efficient dominating set and intuitionistic fuzzy graph. We also introduce an intuitionistic fuzzy graph and a strong efficient dominating number of fuzzy graphs.
S Rajeev Gandhi +4 more
doaj +1 more source
On minimum intersections of certain secondary dominating sets in graphs [PDF]
Opuscula Mathematica, 2023 In this paper we consider secondary dominating sets, also named as \((1,k)\)-dominating sets, introduced by Hedetniemi et al. in 2008. In particular, we study intersections of the \((1,1)\)-dominating sets and proper \((1,2)\)-dominating sets.
Anna Kosiorowska +2 more
doaj +1 more source
Reconfiguration of Dominating Sets [PDF]
Journal of Combinatorial Optimization, 2014 12 pages, 4 ...
Suzuki, Akira +2 more
openaire +3 more sources