Connected power domination in graphs
From MaRDI portal
Publication:2424811
DOI10.1007/s10878-019-00380-7zbMath1420.05127arXiv1712.02388OpenAlexW2963641569MaRDI QIDQ2424811
Logan Smith, Derek Mikesell, Boris Brimkov
Publication date: 25 June 2019
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.02388
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Applications of graph theory to circuits and networks (94C15) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (6)
On the semitotal forcing number of a graph ⋮ Hardness results of connected power domination for bipartite graphs and chordal graphs ⋮ Improved Computational Approaches and Heuristics for Zero Forcing ⋮ Algorithms and Complexity of Power Domination in Graphs ⋮ Power domination on triangular grids with triangular and hexagonal shape ⋮ Power domination throttling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast-mixed searching and related problems on graphs
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
- Generalized power domination of graphs
- Zero forcing number, path cover number, and maximum nullity of cacti
- Parameterized power domination complexity
- On the \({k}\)-power domination of hypergraphs
- Solving connected dominating set faster than \(2^n\)
- On minimum rank and zero forcing sets of a graph
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation
- Using separation algorithms to generate mixed integer model reformulations
- Computational approaches for zero forcing and related problems
- Note on power propagation time and lower bounds for the power domination number
- Complexity and algorithms for the connected vertex cover problem in 4-regular graphs
- A note on finding the bridges of a graph
- Computation of minimal rank and path cover number for certain graphs
- Complexity and computation of connected zero forcing
- Generalized power domination: propagation radius and Sierpiński graphs
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Restricted power domination and zero forcing problems
- Bounds on the connected domination number of a graph
- Zero forcing sets and the minimum rank of graphs
- Minimum-rank matrices with prescribed graph
- On the difference between the maximum multiplicity and path cover number for tree-like graphs
- Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
- Integer Programming Formulation of Traveling Salesman Problems
- Solving Connected Subgraph Problems in Wildlife Conservation
- Connected Domination and Spanning Trees with Many Leaves
- Domination in Graphs Applied to Electric Power Networks
- The Price of Connectivity for Vertex Cover
- The PMU Placement Problem
- Fundamentals of Computation Theory
- Computing and Combinatorics
- Approximation Algorithms and Hardness for Domination with Propagation
- Power domination with bounded time constraints
This page was built for publication: Connected power domination in graphs
