Minimum rank and zero forcing number for butterfly networks

DOI10.1007/s10878-018-0335-1zbMath1420.05165arXiv1607.07522OpenAlexW2476540827WikidataQ57955239 ScholiaQ57955239MaRDI QIDQ2424660

Cyriac Grigorious, Thomas Kalinowski, Daniela Ferrero, Sudeep Stephen, Joseph F. Ryan

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/1607.07522

zbMATH Keywords

butterfly networkzero forcingminimum rank of graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Applications of graph theory to circuits and networks (94C15) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (5)

On the zero blocking number of rectangular, cylindrical, and Möbius grids ⋮ Blocking zero forcing processes in Cartesian products of graphs ⋮ Zero forcing versus domination in cubic graphs ⋮ On the zero forcing number of a graph involving some classical parameters ⋮ Edge Forcing in Butterfly Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast-mixed searching and related problems on graphs
• Propagation time for zero forcing on a graph
• On minimum rank and zero forcing sets of a graph
• The minimum rank of symmetric matrices described by a graph: a survey
• Fugitive-search games on graphs and related parameters
• Note on power propagation time and lower bounds for the power domination number
• Zero forcing sets and the minimum rank of graphs
• On the Fast Searching Problem
• Nondiscriminatory propagation on trees
• Monotonicity in graph searching
• Domination in Graphs Applied to Electric Power Networks
• Black hole search in common interconnection networks

This page was built for publication: Minimum rank and zero forcing number for butterfly networks