On the Laplacian integral tricyclic graphs

A graph is called Laplacian integral if all its Laplacian eigenvalues are integers. In this paper, we give an edge subdividing theorem for Laplacian eigenvalues of a graph (Theorem 2.1) and characterize a class of k-cyclic graphs whose algebraic connectivity is less than one. Using these results, we determine all the Laplacian integral tricyclic graphs. Furthermore, we show that all the Laplacian integral tricyclic graphs are determined by their Laplacian spectra.     

On graphs with the largest Laplacian index

Let G be a connected simple graph on n vertices. The Laplacian index of G, namely, the greatest Laplacian eigenvalue of G, is well known to be bounded above by n. In this paper, we give structural characterizations for graphs G with the largest Laplacian index n. Regular graphs, Hamiltonian graphs and planar graphs with the largest Laplacian index are investigated. We present a necessary and sufficient condition on n and k for the existence of a k-regular graph G of order n with the largest Laplacian index n. We prove that for a graph G of order n ⩾ 3 with the largest Laplacian index n, G is Hamiltonian if G is regular or its maximum vertex degree is Δ(G) = n/2. Moreover, we obtain some useful inequalities concerning the Laplacian index and the algebraic connectivity which produce miscellaneous related results. The first author is supported by NNSF of China (No. 10771080) and SRFDP of China (No. 20070574006). The work was done when Z. Chen was on sabbatical in China.     

Partition graphs for finite symmetric groups

This paper outlines an investigation of a class of arc-transitive graphs admitting a finite symmetric group S_n acting primitively on vertices, with vertex-stabilizer isomorphic to the wreath product S_m wr S_r (preserving a partition of {1,2,…n} into r parts of equal size m). Several properties of these graphs are considered, including their correspondence with r × r matrices with constant row- and column-sums equal to m, their girth, and the local action of the vertex-stabilizer. Also, it is shown that the only instance where S_n acts transitively on 2-arcs occurs in the case m = r = 2. © 1997 John Wiley & Sons, Inc. J Graph Theory 25: 107–117, 1997     

The Laplacian spectra of graphs with a tree structure

Trees are very common in the theory and applications of combinatorics. In this article, we consider graphs whose underlying structure is a tree, except that its vertices are graphs in their own right and where adjacent graphs (vertices) are linked by taking their join. We study the spectral properties of the Laplacian matrices of such graphs. It turns out that in order to capture known spectral properties of the Laplacian matrices of trees, it is necessary to consider the Laplacians of vertex-weighted graphs. We focus on the second smallest eigenvalue of such Laplacians and on the properties of their corresponding eigenvector. We characterize the second smallest eigenvalue in terms of the Perron branches of a tree. Finally, we show that our results are applicable to advancing the solution to the problem of whether there exists a graph on n vertices whose Laplacian has the integer eigenvalues 0, 1, …, n ? 1.     

Lower bounds of the Laplacian spectrum of graphs based on diameter

Let G be a connected graph of order n. The diameter of G is the maximum distance between any two vertices of G. In the paper, we will give some lower bounds for the algebraic connectivity and the Laplacian spectral radius of G in terms of the diameter of G.     

On the extendability of certain semi-Cayley graphs of finite abelian groups

A connected graph Γ with at least 2n+2 vertices is said to be n-extendable if every matching of size n in Γ can be extended to a perfect matching. The aim of this paper is to study the 1-extendability and 2-extendability of certain semi-Cayley graphs of finite abelian groups, and the classification of connected 2-extendable semi-Cayley graphs of finite abelian groups is given. Thus the 1-extendability and 2-extendability of Cayley graphs of non-abelian groups which can be realized as such semi-Cayley graphs of abelian groups can be deduced. In particular, the 1-extendability and 2-extendability of connected Cayley graphs of generalized dicyclic groups and generalized dihedral groups are characterized.     

Bounding the sum of powers of the Laplacian eigenvalues of graphs

For a non-zero real number α, let s _α (G) denote the sum of the αth power of the non-zero Laplacian eigenvalues of a graph G. In this paper, we establish a connection between s _α (G) and the first Zagreb index in which the Hölder’s inequality plays a key role. By using this result, we present a lot of bounds of s _α (G) for a connected (molecular) graph G in terms of its number of vertices (atoms) and edges (bonds). We also present other two bounds for s _α (G) in terms of connectivity and chromatic number respectively, which generalize those results of Zhou and Trinajsti? for the Kirchhoff index [B Zhou, N Trinajsti?. A note on Kirchhoff index, Chem. Phys. Lett., 2008, 455: 120–123].     

On the distribution of Laplacian eigenvalues of trees

For a tree T$T$ with n$n$ vertices, we apply an algorithm due to Jacobs and Trevisan (2011) to study how the number of small Laplacian eigenvalues behaves when the tree is transformed by a transformation defined by Mohar (2007). This allows us to obtain a new bound for the number of eigenvalues that are smaller than 2. We also report our progress towards a conjecture on the number of eigenvalues that are smaller than the average degree.     

On the minimum degree,edge-connectivity and connectivity of power graphs of finite groups

In this paper, the minimum degree of power graphs of certain cyclic groups, abelian p-groups, dihedral groups and dicyclic groups are obtained. It is ascertained that the edge-connectivity and minimum degree of power graphs are equal, and consequently, the minimum disconnecting sets of power graphs of the aforementioned groups are determined. In order to investigate the equality of connectivity and minimum degree of power graphs, certain necessary conditions for finite groups and a necessary and su?cient condition for finite cyclic groups are obtained. Moreover, the equality is discussed for the power graphs of abelian p-groups, dihedral groups and dicyclic groups.     

Subgroup separability of graphs of abelian groups

In the present paper we give necessary and sufficient conditions for the subgroup separability of the fundamental group of a finite graph of groups with finitely generated abelian vertex groups.

     

Perron components and algebraic connectivity for weighted graphs

The algebraic connectivity of a connected graph is the second-smallest eigenvalue of its Laplacian matrix, and a remarkable result of Fiedler gives information on the structure of the eigenvectors associated with that eigenvalue. In this paper, we introduce the notion of a perron component at a vertex in a weighted graph, and show how the structure of the eigenvectors associated with the algebraic connectivity can be understood in terms of perron components. This leads to some strengthening of Fiedler's original result, gives some insights into weighted graphs under perturbation, and allows for a discussion of weighted graphs exhibiting tree-like structure.     

Affine distance-transitive graphs and classical groups

This paper finishes the classification of the finite primitive affine distance-transitive graphs by dealing with the only case left open, namely where the generalized Fitting subgroup of the stabilizer of a vertex is modulo scalars a simple group of classical Lie type defined over the characteristic dividing the number of vertices of the graph. All graphs that are found to occur are known.     

Edge-maximality of power graphs of finite cyclic groups

We show that among all finite groups of any given order, the cyclic group of that order has the maximum number of edges in its power graph.     

Connectivity of intersection graphs of finite groups

The intersection graph of a group G is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of G, and there is an edge between two distinct vertices H and K if and only if H∩K≠1 where 1 denotes the trivial subgroup of G. In this paper, we classify finite solvable groups whose intersection graphs are not 2-connected and finite nilpotent groups whose intersection graphs are not 3-connected. Our methods are elementary.     

双圈图的Laplace矩阵的谱半径

利用奇异点对的分类,得到了n阶双圈图的Laplace矩阵的谱半径的第二至第八大值,并且刻划了达到这些上界的极图.