the National Natural Science Foundation of China(No.10331020,10601038)
Wenger's graph Hm(q) is a q-regular bipartite graph of order 2qm constructed by using the mdimensional vector space Fq^m over the finite field Fq. The existence of the cycles of certain even length plays an importa...
the National Natural Science Foundation of China(10331020).
A graph G of order n is called a bicyclic graph if G is connected and the number of edges of G is n+1. Let B(n) be the set of all bicyclic graphs on n vertices. In this paper, the first three largest spectral radii...