On the Spectrum of Laplacian Matrix

@article{Jahanbani2021OnTS,
  title={On the Spectrum of Laplacian Matrix},
  author={Akbar Jahanbani and Seyed Mahmoud Sheikholeslami and R. Khoeilar},
  journal={Mathematical Problems in Engineering},
  year={2021},
  volume={2021},
  pages={1-4}
}
Let G be a simple graph of order n. +e matrixL(G) � D(G) − A(G) is called the Laplacian matrix of G, where D(G) and A(G) denote the diagonal matrix of vertex degrees and the adjacency matrix of G, respectively. Let l1(G), ln− 1(G) be the largest eigenvalue, the second smallest eigenvalue of L(G) respectively, and λ1(G) be the largest eigenvalue of A(G). In this paper, we will present sharp upper and lower bounds for l1(G) and ln− 1(G). Moreover, we investigate the relation between l1(G) and λ1… 
View PDF
1 Citations
Methods Citations
1

One Citation

Citation Type

Citation Type

Green Communication for Sixth-Generation Intent-Based Networks: An Architecture Based on Hybrid Computational Intelligence Algorithm
TLDR
This paper presents hybridization between two Computational Intelligence algorithms called the Marine Predator Algorithm and the Generalized Normal Distribution Optimization (MPGND) to save power consumption which is an important problem in sustainable green 6G-IBN.

References

SHOWING 1-10 OF 21 REFERENCES
Laplacian matrices of graphs: a survey
Properties of spectra of graphs and line graphs
Let G be a simple connected graph with n vertices and m edges, LG be the line graph of G and λ1 (LG) ≥ λ2 (LG) ≥ … ≥ λm (LG) be the eigenvalues of the graph LG. In this paper, the range of…
NEW UPPER BOUND ON THE LARGEST LAPLACIAN EIGENVALUE OF GRAPHS
Let G = (V;E) be a simple, undirected graph with maximum and minimum degree ∆ and respectively, and let A be the adjacency matrix and Q be the Laplacianmatrix of G. In the past decades, the Laplacian…
A Sharp Upper Bound for the Number of Spanning Trees of a Graph
  • K. Das
  • Mathematics
    Graphs Comb.
  • 2007
TLDR
An upper bound for the number of spanning trees of G on n, e and d1 only is established, which holds if and only if G is a star graph or a complete graph.
On the Sum of k Largest Laplacian Eigenvalues of a Graph and Clique Number
For a simple graph G with order n and size m having Laplacian eigenvalues $$\mu _1, \mu _2, \dots , \mu _{n-1},\mu _n=0$$ μ 1 , μ 2 , ⋯ , μ n - 1 , μ n = 0 , let $$S_k(G)=\sum _{i=1}^{k}\mu _i$$ S k…
On sum of powers of the Laplacian eigenvalues of graphs
Spectral Gap of the Largest Eigenvalue of the Normalized Graph Laplacian
We offer a new method for proving that the maximal eigenvalue of the normalized graph Laplacian of a graph with $n$ vertices is at least $\frac{n+1}{n-1}$ provided the graph is not complete and that…
Bounds for the Laplacian spectral radius of graphs
TLDR
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the LaPLacian matrix, known as the Laplacian spectral radius, of a graph, as functions of graph parameters.
Lower bounds for the Laplacian spectral radius of an oriented hypergraph
TLDR
New lower bounds for the Laplacian spectral radius of incidencesimple oriented hypergraphs are found that improve on previous lower bounds by including edge size instead of only using vertex degree.
Some eigenvalue properties in graphs (conjectures of Graffiti - II)
...
...