Supported by National Natural Science Foundation of China(Grant No.11071078)
Let G(n,k,t) be a set of graphs with n vertices,k cut edges and t cut vertices.In this paper,we classify these graphs in G(n,k,t) according to cut vertices,and characterize the extremal graphs with the largest spe...
Supported by the National Natural Science Foundation of China (No. 11071078)
Let gnk denote a set of graphs with n vertices and k cut edges. In this paper, we obtain an order of the first four graphs in gnk in terms of their spectral radii for 6 ≤ k ≤ n-2/3.
National Natural Science Foundation of China (No. 11071078,No. 11075057 );Open Research Funding Program of LGISEM and Shanghai Leading Academic Discipline Project,China (No. B407)
A graph G is said to be determined by its Laplacian spectrum if any graph having the same Laplacian spectrum as G is isomorphic to G.We consider θ-graphs,that is,graphs obtained by subdividing the edges of the multig...