On Algebraic Connectivity of Unicyclicgraph with Perfect Matching

2007 
It was proved thatthe algebraic connectivity of any unicyclic graph of order n(n≥22) with perfect matching does not exceed (3-5~(1/2))/2.All the unicyclic graphs of order n(n≥22) with perfect matching whose algebraic connectivity attains (3-5~(1/2))/2 were also determind.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    0
    References
    0
    Citations
    NaN
    KQI
    []