The spread of the spectrum of a graph
- Gregory, DavidA.
- Hershkowitz, Daniel
- Kirkland, StephenJ.
DOIAbstract
AbstractUpper and lower bounds are obtained for the spread λ1−λn of the eigenvalues λ1⩾λ2⩾⋯⩾λn of the adjacency matrix of a simple graph
AbstractUpper and lower bounds are obtained for the spread λ1−λn of the eigenvalues λ1⩾λ2⩾⋯⩾λn of the adjacency matrix of a simple graph
AbstractLet D(G)=(di,j)n×n denote the distance matrix of a connected graph G with order n, where dij...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
The spread of an $n\times n$ complex matrix $B$ with eigenvalues $\beta _{1},\beta _{2},\ldots ,\be...
AbstractThe largest eigenvalue of the adjacency matrix of a graph has received considerable attentio...
The largest eigenvalue of the adjacency matrix of a graph has received considerable attention in the...
AbstractThe spread s(M) of an n×n complex matrix M is s(M)=maxij|λi-λj|, where the maximum is taken ...
The spread s(M) of an n × n complex matrix M is s(M) = maxij |_i − _j |, where the maximum is taken...
The spread s(M) of an n × n complex matrix M is s(M) = maxij |_i − _j |, where the maximum is taken...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
The spread s(M) of an n × n complex matrix M is s(M) = maxij |_i − _j |, where the maximum is taken...
AbstractLet G be a simple connected graph with n vertices and n edges which we call a unicyclic grap...
Let G be a simple connected graph with n vertices and n edges which we call an unicyclic graph. In t...
In this BSc thesis we deal with matrix graph theory. We are interested primarily in the eigenvalues ...
AbstractThe Laplacian spread s(G) of a graph G is defined to be the difference between the largest e...
AbstractThe spread of a graph is defined to be the difference between the largest eigenvalue and the...
AbstractLet D(G)=(di,j)n×n denote the distance matrix of a connected graph G with order n, where dij...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
The spread of an $n\times n$ complex matrix $B$ with eigenvalues $\beta _{1},\beta _{2},\ldots ,\be...
AbstractThe largest eigenvalue of the adjacency matrix of a graph has received considerable attentio...
The largest eigenvalue of the adjacency matrix of a graph has received considerable attention in the...
AbstractThe spread s(M) of an n×n complex matrix M is s(M)=maxij|λi-λj|, where the maximum is taken ...
The spread s(M) of an n × n complex matrix M is s(M) = maxij |_i − _j |, where the maximum is taken...
The spread s(M) of an n × n complex matrix M is s(M) = maxij |_i − _j |, where the maximum is taken...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
The spread s(M) of an n × n complex matrix M is s(M) = maxij |_i − _j |, where the maximum is taken...
AbstractLet G be a simple connected graph with n vertices and n edges which we call a unicyclic grap...
Let G be a simple connected graph with n vertices and n edges which we call an unicyclic graph. In t...
In this BSc thesis we deal with matrix graph theory. We are interested primarily in the eigenvalues ...
AbstractThe Laplacian spread s(G) of a graph G is defined to be the difference between the largest e...
AbstractThe spread of a graph is defined to be the difference between the largest eigenvalue and the...
AbstractLet D(G)=(di,j)n×n denote the distance matrix of a connected graph G with order n, where dij...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
The spread of an $n\times n$ complex matrix $B$ with eigenvalues $\beta _{1},\beta _{2},\ldots ,\be...
Add to ORKG