Zero forcing number of a graph in terms of the number of pendant vertices

DOI10.1080/03081087.2018.1545829zbMath1459.05248OpenAlexW2901448048WikidataQ114641342 ScholiaQ114641342MaRDI QIDQ4965925

Xinlei Wang, Dein Wong, Yuanshuai Zhang

Publication date: 18 March 2021

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2018.1545829

zbMATH Keywords

pendant verticesminimum rankzero forcing number

Mathematics Subject Classification ID

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

Related Items (5)

On the zero forcing number and spectral radius of graphs ⋮ On graphs maximizing the zero forcing number ⋮ The zero forcing number of graphs with the matching number and the cyclomatic number ⋮ Bounding the total forcing number of graphs ⋮ On the zero forcing number of a graph involving some classical parameters

Cites Work

• Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
• A technique for computing the zero forcing number of a graph with a cut-vertex
• Propagation time for zero forcing on a graph
• Upper bounds on the \(k\)-forcing number of a graph
• Zero forcing sets and bipartite circulants
• Zero forcing parameters and minimum rank problems
• The minimum rank of symmetric matrices described by a graph: a survey
• A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
• Zero forcing sets and the minimum rank of graphs
• Iteration Index of a Zero Forcing Set in a Graph
• Metric Dimension and Zero Forcing Number of Two Families of Line Graphs
• Dynamic approach to k-forcing

This page was built for publication: Zero forcing number of a graph in terms of the number of pendant vertices