Complexity and Algorithms for Semipaired Domination in Graphs
Sign Up to like & getrecommendations! Published in 2020 at "Theory of Computing Systems"
DOI: 10.1007/s00224-020-09988-3
Abstract: For a graph G = ( V , E ) with no isolated vertices, a set D ⊆ V $D\subseteq V$ is called a semipaired dominating set of G if ( i ) D is… read more here.
Keywords: graphs; semipaired domination; minimum semipaired; dominating set ... See more keywords
Edge Weighting Functions on Semitotal Dominating Sets
Sign Up to like & getrecommendations! Published in 2017 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-017-1769-4
Abstract: A set S of vertices in an isolate-free graph G is a semitotal dominating set of G if it is a dominating set of G and every vertex in S is within distance 2 of another… read more here.
Keywords: domination number; semitotal dominating; edge weighting; dominating set ... See more keywords
Critical node identification for complex network based on a novel minimum connected dominating set
Sign Up to like & getrecommendations! Published in 2017 at "Soft Computing"
DOI: 10.1007/s00500-016-2303-y
Abstract: Identifying critical nodes in complex networks aims to fragment a graph $$G = (V, E)$$G=(V,E) by removing a set of vertices R with cardinality $$\left| R \right| \le $$R≤ k, such that the residual graph… read more here.
Keywords: critical nodes; network; minimum connected; dominating set ... See more keywords
Perfect edge domination: hard and solvable cases
Sign Up to like & getrecommendations! Published in 2018 at "Annals of Operations Research"
DOI: 10.1007/s10479-017-2664-3
Abstract: Let G be an undirected graph. An edge of Gdominates itself and all edges adjacent to it. A subset $$E'$$E′ of edges of G is an edge dominating set of G, if every edge of… read more here.
Keywords: edge dominating; perfect edge; edge; graph ... See more keywords
Independent bondage number of a graph
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-018-0319-1
Abstract: A vertex set S of a simple finite graph $$G=(V;E)$$G=(V;E) is said to be an independent set if there is no edge between any pair of vertices of S and a dominating set if for… read more here.
Keywords: bondage number; dominating set; independent bondage; independent dominating ... See more keywords
The probabilistic and reliable connected power dominating set problems
Sign Up to like & getrecommendations! Published in 2019 at "Optimization Letters"
DOI: 10.1007/s11590-018-1339-6
Abstract: As a variation of minimum dominating set problem, the power dominating set problem is proposed to achieve the complete observation of a power system by placing the smallest number of PMUs. Under different contingencies consisting… read more here.
Keywords: connected power; problem; power; dominating set ... See more keywords
Greedy approximation for the minimum connected dominating set with labeling
Sign Up to like & getrecommendations! Published in 2021 at "Optimization Letters"
DOI: 10.1007/s11590-020-01628-6
Abstract: Given a connected graph $$G=(V,E)$$ G = ( V , E ) . A subset $$C\subseteq V$$ C ⊆ V is a dominating set if every vertex of V is either in C or adjacent… read more here.
Keywords: span; approximation; dominating set; mathrm ... See more keywords
Enhanced route discovery using connected dominating set and 2-hop repair in wireless ad hoc networks
Sign Up to like & getrecommendations! Published in 2021 at "Journal of Ambient Intelligence and Humanized Computing"
DOI: 10.1007/s12652-020-01799-1
Abstract: Efficient routing and broadcasting among a set of nodes play a critical role in wireless adhoc networks. for energy efficient routing, a connected dominating set (CDS) based virtual backbone is a promising approach. In the… read more here.
Keywords: hop; dominating set; connected dominating; route discovery ... See more keywords
Locating-Total Domination in Grid Graphs
Sign Up to like & getrecommendations! Published in 2019 at "Bulletin of the Malaysian Mathematical Sciences Society"
DOI: 10.1007/s40840-019-00733-9
Abstract: Let $$G=(V,E)$$ G = ( V , E ) be a graph with no isolated vertex. A subset $$S\subseteq V(G)$$ S ⊆ V ( G ) is a total dominating set of graph G if… read more here.
Keywords: total domination; locating total; dominating set; total dominating ... See more keywords
An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks
Sign Up to like & getrecommendations! Published in 2018 at "Physica A: Statistical Mechanics and its Applications"
DOI: 10.1016/j.physa.2018.02.119
Abstract: Abstract The positive influence dominating set problem is a variant of the minimum dominating set problem, and has lots of applications in social networks. It is NP-hard, and receives more and more attention. Various methods… read more here.
Keywords: social networks; dominating set; positive influence; problem ... See more keywords
EDGE WEIGHTING FUNCTIONS ON THE SEMITOTAL DOMINATING SET OF CLAW-FREE GRAPHS
Sign Up to like & getrecommendations! Published in 2024 at "Bulletin of the Australian Mathematical Society"
DOI: 10.1017/s0004972724000017
Abstract: Abstract In an isolate-free graph G, a subset S of vertices is a semitotal dominating set of G if it is a dominating set of G and every vertex in S is within distance 2… read more here.
Keywords: dominating set; claw free; semitotal dominating; graphs ... See more keywords