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].     

Resistance distance and Laplacian spectrum

The resistance distance r _ij between two vertices v _i and v _j of a (connected, molecular) graph G is equal to the resistance between the respective two points of an electrical network, constructed so as to correspond to G, such that the resistance of any two adjacent points is unity. We show how the matrix elements r _ij can be expressed in terms of the Laplacian eigenvalues and eigenvectors of G. In addition, we determine certain properties of the resistance matrix R=||r _ij ||. AcknowledgementsThis research was supported by the Natural Science Foundation of China and Fujian Province, and by the Ministry of Sciences, Technologies and Development of Serbia, within Project no. 1389. The authors thank Douglas J. Klein (Galveston) for useful comments.     

Some results on resistance distances and resistance matrices

In this paper, we obtain formulas for resistance distances and Kirchhoff index of subdivision graphs. An application of resistance distances to the bipartiteness of graphs is given. We also give an interlacing inequality for eigenvalues of the resistance matrix and the Laplacian matrix.     

On the Kirchhoff index of some toroidal lattices

The resistance distance is a novel distance function on a graph proposed by Klein and Randi? [D.J. Klein and M. Randi?, Resistance distance, J. Math. Chem. 12 (1993), pp. 81–85]. The Kirchhoff index of a graph G is defined as the sum of resistance distances between all pairs of vertices of G. In this article, based on the result by Gutman and Mohar [I. Gutman and B. Mohar, The quasi-Wiener and the Kirchhoff indices coincide, J. Chem. Inf. Comput. Sci. 36 (1996), pp. 982–985], we compute the Kirchhoff index of the square, 8.8.4, hexagonal and triangular lattices, respectively.     

Deletion and contraction identities for the resistance values and the Kirchhoff index

We establish identities, which we call deletion and contraction identities, for the resistance values on an electrical network. As an application of these identities, we give an upper bound to the Kirchhoff index of a molecular graph. Our upper bound, expressed in terms of the set of vertices and the edge connectivity of the graph, improves previously known upper bounds. © 2010 Wiley Periodicals, Inc. Int J Quantum Chem, 2010     

关于两个图的一类新连接图的谱

给定2个图G1和G2，设G1的边集E(G1)={e1,e2,?,em1}，则图G1⊙G2可由一个G1，m1个G2通过在G1对应的每条边外加一个孤立点，新增加的点记为U={u1,u2,?,um1}，将ui分别与第i个G2的所有点以及G1中的边ei的端点相连得到，其中i=?1,2,?,m1。得到：（i）当G1是正则图，G2是正则图或完全二部图时，确定了G1⊙G2的邻接谱（A-谱）。（ii）当G1是正则图，G2是任意图时，给出了G1⊙G2的拉普拉斯谱（L-谱）。（iii）当G1和G2都是正则图时，给出了G1⊙G2的无符号拉普拉斯谱（Q-谱）。作为以上结论的应用，构建了无限多对A-同谱图、L-同谱图和Q-同谱图；同时当G1是正则图时，确定了G1⊙G2支撑树的数量和Kirchhoff指数。     

Applications of Markov spectra for the weighted partition network by the substitution rule

The weighted self-similar network is introduced in an iterative way. In order to understand the topological properties of the self-similar network, we have done a lot of research in this field.Firstly, according to the symmetry feature of the self-similar network, we deduce the recursive relationship of its eigenvalues at two successive generations of the transition-weighted matrix.Then, we obtain eigenvalues of the Laplacian matrix from these two successive generations.Finally, we calculate an accurate expression for the eigentime identity and Kirchhoff index from the spectrum of the Laplacian matrix.     

Another look at the degree‐Kirchhoff index

Let G be an arbitrary graph with vertex set {1,2, …,N} and degrees d_i ≤ D, for fixed D and all i, then for the index R′(G) = ∑_{i < j}d_id_jR_ij we show that We also show that the minimum of R′(G) over all N‐vertex graphs is attained for the star graph and its value is 2N² ? 5N + 3. © 2010 Wiley Periodicals, Inc. Int J Quantum Chem, 2011     

On resistance-distance and Kirchhoff index

We provide some properties of the resistance-distance and the Kirchhoff index of a connected (molecular) graph, especially those related to its normalized Laplacian eigenvalues.