DOIAbstract
AbstractIn the note, we present an upper bound for the spectral radius of Laplacian matrix of a graph in terms of a “2-degree” of a vertex
AbstractIn the note, we present an upper bound for the spectral radius of Laplacian matrix of a graph in terms of a “2-degree” of a vertex
summary:Let $G$ be a graph with $n$ vertices, $m$ edges and a vertex degree sequence $(d_1, d_2, ...
AbstractLet G be a graph on vertex set V=v1,v2,…,vn. Let di be the degree of vi, let Ni be the set o...
AbstractLet G=(V,E) be a simple graph on vertex set V={v1,v2,…,vn}. Further let di be the degree of ...
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian mat...
Abstract. Let G =(V,E) be a simple connected graph with n vertices and e edges. Assume that the vert...
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractThe spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph an...
AbstractWe first give a result on eigenvalues of the line graph of a graph. We then use the result t...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
The spectrum of the Laplacian matrix of a network plays a key role in a wide range of dynamical prob...
For a k-graph H = (V(H), E(H)), let B(H) be its incidence matrix, and Q(H) = B(H)B(H)T be its signle...
In this paper, we established a connection between the Laplacian eigenvalues of a signed graph and t...
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian mat...
Let G be a simple graph of order n. The matrix ℒG=DG−AG is called the Laplacian matrix of G, where D...
AbstractThe Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix...
summary:Let $G$ be a graph with $n$ vertices, $m$ edges and a vertex degree sequence $(d_1, d_2, ...
AbstractLet G be a graph on vertex set V=v1,v2,…,vn. Let di be the degree of vi, let Ni be the set o...
AbstractLet G=(V,E) be a simple graph on vertex set V={v1,v2,…,vn}. Further let di be the degree of ...
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian mat...
Abstract. Let G =(V,E) be a simple connected graph with n vertices and e edges. Assume that the vert...
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractThe spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph an...
AbstractWe first give a result on eigenvalues of the line graph of a graph. We then use the result t...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
The spectrum of the Laplacian matrix of a network plays a key role in a wide range of dynamical prob...
For a k-graph H = (V(H), E(H)), let B(H) be its incidence matrix, and Q(H) = B(H)B(H)T be its signle...
In this paper, we established a connection between the Laplacian eigenvalues of a signed graph and t...
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian mat...
Let G be a simple graph of order n. The matrix ℒG=DG−AG is called the Laplacian matrix of G, where D...
AbstractThe Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix...
summary:Let $G$ be a graph with $n$ vertices, $m$ edges and a vertex degree sequence $(d_1, d_2, ...
AbstractLet G be a graph on vertex set V=v1,v2,…,vn. Let di be the degree of vi, let Ni be the set o...
AbstractLet G=(V,E) be a simple graph on vertex set V={v1,v2,…,vn}. Further let di be the degree of ...
Add to ORKG