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

DOI10.2478/ausi-2022-0009zbMath1495.05034OpenAlexW4290851324MaRDI QIDQ2674159

Charles Dominic, M. R. Raksha

Publication date: 22 September 2022

Published in: Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/ausi-2022-0009

zbMATH Keywords

zero forcing numberzero forcing setclosed global shadow graphopen global shadow graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Upper bounds on the \(k\)-forcing number of a graph
• Zero forcing number, constrained matchings and strong structural controllability
• An upper bound for the minimum rank of a graph
• Logic circuits from zero forcing
• Zero forcing in claw-free cubic graphs
• Zero forcing number of degree splitting graphs and complete degree splitting graphs
• Zero forcing sets and the minimum rank of graphs
• Power domination in graphs
• Odd Graceful Labeling of Some New Graphs
• Domination in Graphs Applied to Electric Power Networks
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
• Some Theorems on Abstract Graphs

This page was built for publication: Some properties of the closed global shadow graphs and their zero forcing number