Zero forcing in benzenoid network

DOI10.22199/ISSN.0717-6279-2019-05-0064MaRDI QIDQ5142119zbMATH OpenOpenAlexFDO

Authors J. Anitha, Indra Rajasingh

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

zbMATH Keywords

circum-pyrene networkscircum-trizene networkspyrene networkszero forcing set

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90)

Recommendations

• Power domination parameters in honeycomb-like networks
• Power domination in tree derived architectures
• Zero forcing versus domination in cubic graphs
• The zero forcing polynomial of a graph
• Computing the zero forcing number for generalized Petersen graphs

Cites work

• Analytical expressions for Wiener indices of n-circumscribed peri-condensed benzenoid graphs
• Domination in Graphs Applied to Electric Power Networks
• Extremal values and bounds for the zero forcing number
• Logic circuits from zero forcing
• Power domination parameters in honeycomb-like networks
• Zero forcing and power domination for graph products
• Zero forcing sets and the minimum rank of graphs

Cited in

(6)

• The relationship between \(k\)-forcing and \(k\)-power domination
• Zero forcing versus domination in cubic graphs
• Forcing bonds of a benzenoid system
• Power domination parameters in honeycomb-like networks
• Power domination in tree derived architectures
• P₃-forcing in honeycomb networks

This page was built for publication: Zero forcing in benzenoid network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5142119)