Open global shadow graph and it’s zero forcing number

DOI10.22199/ISSN.0717-6279-5305MaRDI QIDQ6168623zbMATH OpenOpenAlexFDO

Authors M. R. Raksha, Charles Dominic

Publication date 11 July 2023

Published in Proyecciones (Antofagasta) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.22199/issn.0717-6279-5305

zbMATH Keywords

open global shadow graphzero forcing numberzero forcing set

Mathematics Subject Classification ID

Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Some properties of the closed global shadow graphs and their zero forcing number
• On minimum rank and zero forcing sets of a graph
• Zero forcing parameters and minimum rank problems
• The zero forcing number of graphs with the matching number and the cyclomatic number
• Zero forcing sets and the minimum rank of graphs

Cites work

• A technique for computing the zero forcing number of a graph with a cut-vertex
• An upper bound for the minimum rank of a graph
• Extremal values and bounds for the zero forcing number
• Hamiltonicity in connected regular graphs
• scientific article; zbMATH DE number 3702724 (Why is no real title available?)
• Upper bounds on the \(k\)-forcing number of a graph
• Zero forcing sets and the minimum rank of graphs

Cited in

(1)

• Some properties of the closed global shadow graphs and their zero forcing number

This page was built for publication: Open global shadow graph and it’s zero forcing number

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