the least algebraic connectivity of graphs is defined as the second smallest eigenvalue of the laplacian matrix of the graph,which is a parameter to measure how well a graph is connected. In this paper, we present two unique graphs whose algebraic connectivity attain the minimum among all graphs whose complements are trees,but not stars,and among all graphs whose complements are unicyclic graphs, but not stars adding one edge,respectively.
conflict of interests
the authors declare that there is no conflict of interests regarding the publication of this paper.
Acknowledgments
this work is jointly supported by the national natural science foundation of china under grant nos. 11071001 and 11071002, the natural science foundation of anhui province of china under grant no.11040606M14, and the natural science foundation of department of education of anhui province of ckina under grant nos.
the least algebraic connectivity of graphs is defined as the second smallest eigenvalue of the laplacian matrix of the graph,which is a parameter to measure how well a graph is connected. In this paper, we present two unique graphs whose algebraic connectivity attain the minimum among all graphs whose complements are trees,but not stars,and among all graphs whose complements are unicyclic graphs, but not stars adding one edge,respectively. conflict of intereststhe authors declare that there is no conflict of interests regarding the publication of this paper.Acknowledgmentsthis work is jointly supported by the national natural science foundation of china under grant nos. 11071001 and 11071002, the natural science foundation of anhui province of china under grant no.11040606M14, and the natural science foundation of department of education of anhui province of ckina under grant nos.
การแปล กรุณารอสักครู่..
