Zero forcing in Benzenoid network
From MaRDI portal
Publication:5142119
DOI10.22199/issn.0717-6279-2019-05-0064zbMath1451.05163OpenAlexW2998546970MaRDI QIDQ5142119
Publication date: 29 December 2020
Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.22199/issn.0717-6279-2019-05-0064
Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Analytical expressions for Wiener indices of \(n\)-circumscribed peri-condensed benzenoid graphs
- Extremal values and bounds for the zero forcing number
- Logic circuits from zero forcing
- Zero forcing sets and the minimum rank of graphs
- Power Domination Parameters in Honeycomb-Like Networks
- Domination in Graphs Applied to Electric Power Networks
- Unnamed Item
This page was built for publication: Zero forcing in Benzenoid network