scientific article; zbMATH DE number 7268040

zbMath1446.05054MaRDI QIDQ5130665

K. P. Premodkumar, Charles Dominic, Baby Chacko

Publication date: 28 October 2020

Full work available at URL: http://admjournal.luguniv.edu.ua/index.php/adm/article/view/496

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

zbMATH Keywords

zero forcing numbersplitting graphpath cover number and domination number of a graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (2)

Some properties of the closed global shadow graphs and their zero forcing number ⋮ Zero forcing number of degree splitting graphs and complete degree splitting graphs

Cites Work

• A technique for computing the zero forcing number of a graph with a cut-vertex
• Upper bounds on the \(k\)-forcing number of a graph
• Spectra of graphs
• Minimum rank problems
• Logic circuits from zero forcing
• Zero forcing sets and the minimum rank of graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: