Line graphs: Their maximum nullities and zero forcing numbers

DOI10.1007/s10587-016-0290-xzbMath1413.05225OpenAlexW2531491728MaRDI QIDQ2828813

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

treematrixline graphspositive semidefinite matrixunicyclic graphpositive zero forcing numbermaximum nullityzero forcing number

Mathematics Subject Classification ID

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

Related Items

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, Brushing number and zero-forcing number of graphs and their line graphs, Positive semidefinite zero forcing numbers of two classes of graphs, Unnamed Item

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
• Zero forcing parameters and minimum rank problems
• The minimum rank of symmetric matrices described by a graph: a survey
• Cyclomatic numbers of connected induced subgraphs
• Positive semidefinite zero forcing
• Zero forcing sets and the minimum rank of graphs
• Minimum-rank matrices with prescribed graph
• On the difference between the maximum multiplicity and path cover number for tree-like graphs
• Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees
• Positive semidefinite maximum nullity and zero forcing number
• On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph