Minimum rank and path cover number for generalized and double generalized cycle star graphs

DOI10.1016/J.LAA.2018.05.016zbMath1392.05078OpenAlexW2803488099WikidataQ129775906 ScholiaQ129775906MaRDI QIDQ725515

Cecília Perdigão, Amélia Fonseca

Publication date: 1 August 2018

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

Full work available at URL: https://doi.org/10.1016/j.laa.2018.05.016

zbMATH Keywords

cyclesymmetric matricesminimum rankpath cover numbermaximum multiplicitydouble generalized cycle stargeneralized cycle stargeneralized star

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Connectivity (05C40) Vector spaces, linear dependence, rank, lineability (15A03)

Cites Work

• Unnamed Item
• Computation of minimal rank and path cover number for certain graphs
• Minimum-rank matrices with prescribed graph
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree

This page was built for publication: Minimum rank and path cover number for generalized and double generalized cycle star graphs