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

DOI10.1016/J.LAA.2018.05.016zbMATH Open1392.05078OpenAlexW2803488099WikidataQ129775906 ScholiaQ129775906MaRDI QIDQ725515FDOQ725515

Authors: 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

Recommendations

• Minimum rank of generalized star and complete bipartite graph with loops
• Computation of minimal rank and path cover number for certain graphs
• The minimum multiplicity of star graphs
• Maximum packings and minimum coverings of multigraphs with paths and stars
• scientific article; zbMATH DE number 1033814
• An algorithm for minimum weight star covers of graphs
• Orthogonal double covers of complete bipartite graphs by the union of a cycle and a star
• Minimum coverings of crowns with cycles and stars
• scientific article; zbMATH DE number 5126095
• scientific article; zbMATH DE number 637342

zbMATH Keywords

cyclesymmetric matricesminimum rankmaximum multiplicitypath cover numberdouble 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

• Title not available (Why is that?)
• Computation of minimal rank and path cover number for certain graphs
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• Minimum-rank matrices with prescribed graph

Cited In (1)

• Computation of minimal rank and path cover number for certain graphs

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

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