Abstract
The absolute algebraic connectivity of a graph G is the maximum of algebraic connectivities (second smallest eigenvalue of the Laplacian) for all nonnegative valuations of G whose average value on the edges of G is one. We prove that for a tree T-(V.E). this number is equal to the reciprocal of the variance of T which is the number where d(p,q) means the distance of (metric) points of the tree and M the absolute center of gravity of T, i.e. the (metric)point whose sum of squares of the distances to the vertices is minimal.(Metric means that points within the edges are also allowed). The absolute algebraic connectivity of a tree is always a rational number.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
