scientific article; zbMATH DE number 6857399
From MaRDI portal
Publication:5374237
zbMath1383.05225MaRDI QIDQ5374237
Mary Flagg, Katherine F. Benson, Violeta Vasilevska, Brian Wissman, Veronika Furst, Daniela Ferrero, Leslie Hogben
Publication date: 10 April 2018
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/70/ajc_v70_p221.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items (38)
On the zero forcing number and propagation time of oriented graphs ⋮ Nordhaus-Gaddum problems for power domination ⋮ Computational approaches for zero forcing and related problems ⋮ On the length of L-Grundy sequences ⋮ Maximum nullity and zero forcing of circulant graphs ⋮ On the power domination number of the Cartesian product of graphs ⋮ Note on power propagation time and lower bounds for the power domination number ⋮ Zero forcing and maximum nullity for hypergraphs ⋮ Zero forcing in triangulations ⋮ Restricted power domination and zero forcing problems ⋮ Minimum rank and zero forcing number for butterfly networks ⋮ Connected power domination in graphs ⋮ The \((d-2)\)-leaky forcing number of \(Q_d\) and \(\ell\)-leaky forcing number of \(GP(n,1)\) ⋮ Reconfiguration graphs of zero forcing sets ⋮ The liberation set in the inverse eigenvalue problem of a graph ⋮ 2-power domination number for Knödel graphs and its application in communication networks ⋮ On Grundy total domination number in product graphs ⋮ Zero forcing in iterated line digraphs ⋮ Zero forcing in Benzenoid network ⋮ Bounds on expected propagation time of probabilistic zero forcing ⋮ Grundy domination and zero forcing in regular graphs ⋮ The relationship between \(k\)-forcing and \(k\)-power domination ⋮ Constructions of cospectral graphs with different zero forcing numbers ⋮ Unnamed Item ⋮ Propagation time for probabilistic zero forcing ⋮ Rigid linkages and partial zero forcing ⋮ Complexity and computation of connected zero forcing ⋮ Failed power domination on graphs ⋮ Infectious power domination of hypergraphs ⋮ On the zero forcing number of a graph involving some classical parameters ⋮ On a conjecture for power domination ⋮ Algorithms and Complexity of Power Domination in Graphs ⋮ Power Domination in Graphs ⋮ Note on forcing problem of trees ⋮ Unnamed Item ⋮ Power domination on triangular grids with triangular and hexagonal shape ⋮ Power domination throttling ⋮ Using Markov chains to determine expected propagation time for probabilistic zero forcing
Cites Work
- Fast-mixed searching and related problems on graphs
- Power domination in certain chemical structures
- Minimum rank of skew-symmetric matrices described by a graph
- On minimum rank and zero forcing sets of a graph
- The minimum rank of symmetric matrices described by a graph: a survey
- Note on power propagation time and lower bounds for the power domination number
- Zero forcing sets and the minimum rank of graphs
- A note on power domination in grid graphs
- Power domination in cylinders, tori, and generalized Petersen graphs
- The inverse eigenvalue problem for Hermitian matrices whose graphs are cycles
- Power Domination in Product Graphs
- The Construction of Jacobi and Periodic Jacobi Matrices With Prescribed Spectra
- Domination in Graphs Applied to Electric Power Networks
- The PMU Placement Problem
- Power domination with bounded time constraints
- Unnamed Item
- Unnamed Item
This page was built for publication:
