3,581 research outputs found

    On eigenvalue multiplicity and the girth of a graph

    Get PDF
    Suppose that G is a connected graph of order n and girth g<n. Let k be the multiplicity of an eigenvalue μ of G. Sharp upper bounds for k are n-g+2 when μ∈{-1,0}, and n-g otherwise. The graphs attaining these bounds are described
    • …
    corecore