Line graphs: their maximum nullities and zero forcing numbers.

DOI10.1007/S10587-016-0290-XMaRDI QIDQ2828813zbMATH OpenOpenAlexFDO

Authors Shaun M. Fallat, Abolghasem Soltani

Publication date 26 October 2016

Published in Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10338.dmlcz/145869

zbMATH Keywords

line graphsmatrixmaximum nullitypositive semidefinite matrixpositive zero forcing numbertreeunicyclic graphzero forcing number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76) Vector spaces, linear dependence, rank, lineability (15A03) Eigenvalues, singular values, and eigenvectors (15A18)

Recommendations

• Positive semidefinite maximum nullity and zero forcing number
• Minimum rank, maximum nullity and zero forcing number for selected graph families
• Zero forcing parameters and minimum rank problems
• Zero forcing for sign patterns
• On minimum rank and zero forcing sets of a graph

Cites work

• A technique for computing the zero forcing number of a graph with a cut-vertex
• Cyclomatic numbers of connected induced subgraphs
• Minimum-rank matrices with prescribed graph
• Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees
• On the difference between the maximum multiplicity and path cover number for tree-like graphs
• On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
• Positive semidefinite maximum nullity and zero forcing number
• Positive semidefinite zero forcing
• The minimum rank of symmetric matrices described by a graph: a survey
• Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
• Zero forcing parameters and minimum rank problems
• Zero forcing sets and the minimum rank of graphs

Cited in

(9)

• Families of graphs with maximum nullity equal to zero forcing number
• Brushing number and zero-forcing number of graphs and their line graphs
• From the editor-in-chief
• Positive semidefinite zero forcing numbers of two classes of graphs
• Compressed cliques graphs, clique coverings and positive zero forcing
• A new lower bound for positive zero forcing
• Constructions of cospectral graphs with different zero forcing numbers
• Tree cover number and maximum semidefinite nullity of some graph classes
• On the tree cover number and the positive semidefinite maximum nullity of a graph

This page was built for publication: Line graphs: their maximum nullities and zero forcing numbers.

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