scholarly journals Computing tight upper bounds on the algebraic connectivity of certain graphs

2009 ◽  
Vol 430 (1) ◽  
pp. 532-543 ◽  
Author(s):  
Oscar Rojo
2009 ◽  
Vol 02 (01) ◽  
pp. 71-76 ◽  
Author(s):  
Lihua Feng ◽  
Guihai Yu ◽  
Xiqin Lin

In this paper, we study the Laplacian eigenvalues of graphs on n vertices with domination number γ and present upper bounds for the Laplacian spectral radius and algebraic connectivity as well, which improve old results apparently.


2020 ◽  
Vol 2020 ◽  
pp. 1-6
Author(s):  
Yan Sun ◽  
Faxu Li

It is well known that the algebraic connectivity of a graph is the second small eigenvalue of its Laplacian matrix. In this paper, we mainly research the relationships between the algebraic connectivity and the disjoint vertex subsets of graphs, which are presented through some upper bounds on algebraic connectivity.


2020 ◽  
Vol 12 (02) ◽  
pp. 2050022
Author(s):  
Ruhul Amin ◽  
Sk. Md. Abu Nayeem

The Kirchhoff index and Laplacian-energy-like invariant of a connected graph [Formula: see text], denoted by [Formula: see text] and [Formula: see text], are given by the number of vertex times the sum of the reciprocals of all nonzero Laplacian eigenvalues of [Formula: see text] and the sum of the square roots of all Laplacian eigenvalues of [Formula: see text], respectively. In this paper, we have obtained the Laplacian eigenvalues of some derived graphs, such as double graph, extended double cover and Mycielskian of an [Formula: see text]-regular graph [Formula: see text], in terms of the adjacency eigenvalues of [Formula: see text] and hence, we obtain some upper bounds of Kirchhoff index and Laplacian-energy-like (LEL) invariant of those derived graphs in terms of [Formula: see text], number of vertices and algebraic connectivity of [Formula: see text]. We have shown that the bounds obtained here are better than some existing bounds. We have also obtained the exact formulae for Kirchhoff index and LEL invariant of those derived graph when [Formula: see text] is a complete graph or a complete bipartite graph.


1997 ◽  
Vol 84 (1) ◽  
pp. 176-178
Author(s):  
Frank O'Brien

The author's population density index ( PDI) model is extended to three-dimensional distributions. A derived formula is presented that allows for the calculation of the lower and upper bounds of density in three-dimensional space for any finite lattice.


Author(s):  
S. Yahya Mohamed ◽  
A. Mohamed Ali

In this paper, the notion of energy extended to spherical fuzzy graph. The adjacency matrix of a spherical fuzzy graph is defined and we compute the energy of a spherical fuzzy graph as the sum of absolute values of eigenvalues of the adjacency matrix of the spherical fuzzy graph. Also, the lower and upper bounds for the energy of spherical fuzzy graphs are obtained.


Sign in / Sign up

Export Citation Format

Share Document