scientific article; zbMATH DE number 7528059

zbMath1499.05502MaRDI QIDQ5076794

P. K. Lakshmi Priya, Chitra Suseendran

Publication date: 17 May 2022

Full work available at URL: http://rsmams.org/journals/articleinfo.php?articleid=703&tag=seajmams

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

forcingline graphsforcing numberconnected forcing numberdegree splitting graphsconnected forcing

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Cites Work

• Upper bounds on the \(k\)-forcing number of a graph
• Bounds on the connected forcing number of a graph
• Zero forcing versus domination in cubic graphs
• The Erdős-Sós conjecture for spiders
• Zero forcing sets and the minimum rank of graphs
• The Zero Forcing Number of Graphs
• Connected zero forcing sets and connected propagation time of graphs
• Dynamic approach to k-forcing

This page was built for publication: