Zero forcing in iterated line digraphs
- 17 October 2018
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 255, 198-208
Abstract
No abstract availableKeywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Minimum rank problemsLinear Algebra and its Applications, 2010
- Irreversible -threshold processes: Graph-theoretical threshold models of the spread of disease and of opinionDiscrete Applied Mathematics, 2009
- Zero forcing sets and the minimum rank of graphsLinear Algebra and its Applications, 2008
- Full Control by Locally Induced RelaxationPhysical Review Letters, 2007
- On the structure of the adjacency matrix of the line digraph of a regular digraphDiscrete Applied Mathematics, 2006
- Regular quantum graphsJournal of Physics A: General Physics, 2004
- The underlying line digraph structure of some (0,1)-matrix equationsDiscrete Applied Mathematics, 2002
- Domination in Graphs Applied to Electric Power NetworksSIAM Journal on Discrete Mathematics, 2002
- The Computational Complexity of Some Problems of Linear AlgebraJournal of Computer and System Sciences, 1999
- Quantum Chaos on GraphsPhysical Review Letters, 1997