On the Difference between the Maximum Multiplicity and Path Cover Number for Tree-Like Graphs

@inproceedings{Barioli2004OnTD,
  title={On the Difference between the Maximum Multiplicity and Path Cover Number for Tree-Like Graphs},
  author={Francesco Barioli and Shaun M. Fallat and Leslie Hogben},
  year={2004}
}
For a given undirected graph G, the maximum multiplicity of G is defined to be the largest multiplicity of an eigenvalue over all real symmetric matrices A whose (i, j)th entry is nonzero whenever i 6= j and {i, j} is an edge in G. The path cover number of G is the minimum number of vertex-disjoint paths occurring as induced subgraphs of G that cover all… CONTINUE READING