Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
×
Jul 1, 2023 · Ahanjideh et al. [1] proved a relation between the independence number of a graph and its Laplacian eigenvalue distribution in a certain interval.
For a graph G, let α(G) be the independence number of G, let L(G) be the Laplacian matrix of G, and let mGI be the number of eigenvalues of L(G) in the ...
Nov 24, 2021 · Abstract. Let mGI denote the number of Laplacian eigenvalues of a graph G in an interval I and let α(G) denote the independence number of G.
Let m G I denote the number of Laplacian eigenvalues of a graph G in an interval I and let α ( G ) denote the independence number of G. In this paper, we ...
Let $m_GI$ denote the number of Laplacian eigenvalues of a graph $G$ in an interval $I$ and let $\alpha(G)$ denote the independence number of $G$.
Dec 13, 2023 · Let mGI denote the number of Laplacian eigenvalues of a graph G in an interval I and let α(G) denote the independence number of G. In this ...
For a given graph G of order n, the Laplacian matrix L ( G ) of G is defined as L ( G ) = D ( G ) − A ( G ) , where D ( G ) is the diagonal matrix of vertex ...
People also ask
Apr 16, 2024 · Given an interval I , let m D L ( G ) I (or simply m D L I ) be the number of distance Laplacian eigenvalues of a graph G which lie in I .
Apr 16, 2024 · Distribution of distance Laplacian eigenvalues, independence number, and diameter. We now obtain an upper bound for mDL(G)I, where I is the ...
Jun 2, 2024 · Abstract. Let G be a simple graph of order n. It is known that any Laplacian eigenvalue of G belongs to the interval [0,n].