Ordered algebraic connectivity of tangent bicycle graphs

Yuehui Chen, Jiqing Wan · International Journal of Applied Mathematics & Statistics/International journal of applied mathematics and statistics · 2013

A simple connected graph G of order n is called a tangent bicycle graph if it has n +1 edges and there exist two cycles in G which have just one common vertex. In this paper, the first six largest algebraic connectivity together with their corresponding graphs of n-order tangent bicycle graphs are determined, the order relations of the six ones are also given.

Read the paper · More papers on PaperTik