Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userNew Bounds for the Laplacian Spectral Radius of a Signed Graph
216
0
0.0
(
0
)
Authors
Nathan Reff
Ask ChatGPT about the research
No Arabic abstract
We obtain new bounds for the Laplacian spectral radius of a signed graph. Most of these new bounds have a dependence on edge sign, unlike previously known bounds, which only depend on the underlying structure of the graph. We then use some of these bounds to obtain new bounds for the Laplacian and signless Laplacian spectral radius of an unsigned graph by signing the edges all positive and all negative, respectively.
rate research
Read More
Let $mathcal{G}$ be an undirected graph with adjacency matrix $A$ and spectral radius $rho$. Let $w_k, phi_k$ and $phi_k^{(i)}$ be, respectively, the number walks of length $k$, closed walks of length $k$ and closed walks starting and ending at vertex $i$ after $k$ steps. In this paper, we propose a measure-theoretic framework which allows us to relate walks in a graph with its spectral properties. In particular, we show that $w_k, phi_k$ and $phi_k^{(i)}$ can be interpreted as the moments of three different measures, all of them supported on the spectrum of $A$. Building on this interpretation, we leverage results from the classical moment problem to formulate a hierarchy of new lower and upper bounds on $rho$, as well as provide alternative proofs to several well-known bounds in the literature.
For $0leq alpha < 1$, the $mathcal{A}_{alpha}$-spectral radius of a $k$-uniform hypergraph $G$ is defined to be the spectral radius of the tensor $mathcal{A}_{alpha}(G):=alpha mathcal{D}(G)+(1-alpha) mathcal{A}(G)$, where $mathcal{D}(G)$ and $A(G)$ are diagonal and the adjacency tensors of $G$ respectively. This paper presents several lower bounds for the difference between the $mathcal{A}_{alpha}$-spectral radius and an average degree $frac{km}{n}$ for a connected $k$-uniform hypergraph with $n$ vertices and $m$ edges, which may be considered as the measures of irregularity of $G$. Moreover, two lower bounds on the $mathcal{A}_{alpha}$-spectral radius are obtained in terms of the maximum and minimum degrees of a hypergraph.
We realize many sharp spectral bounds of the spectral radius of a nonnegative square matrix $C$ by using the largest real eigenvalues of suitable matrices of smaller sizes related to $C$ that are very easy to find. As applications, we give a sharp upper bound of the spectral radius of $C$ expressed by the sum of entries, the largest off-diagonal entry $f$ and the largest diagonal entry $d$ in $C$. We also give a new class of sharp lower bounds of the spectral radius of $C$ expressed by the above $d$ and $f$, the least row-sum $r_n$ and the $t$-th largest row-sum $r_t$ in $C$ satisfying $0<r_n-(n-t-1)f-dleq r_t-(n-t)f$, where $n$ is the size of $C$.
Let G be a simple connected graph of order n with degree sequence d_1, d_2, ..., d_n in non-increasing order. The spectral radius rho(G) of G is the largest eigenvalue of its adjacency matrix. For each positive integer L at most n, we give a sharp upper bound for rho(G) by a function of d_1, d_2, ..., d_L, which generalizes a series of previous results.
A connected graph $G$ is a cactus if any two of its cycles have at most one common vertex. Let $ell_n^m$ be the set of cacti on $n$ vertices with matching number $m.$ S.C. Li and M.J. Zhang determined the unique graph with the maximum signless Laplacian spectral radius among all cacti in $ell_n^m$ with $n=2m$. In this paper, we characterize the case $ngeq 2m+1$. This confirms the conjecture of Li and Zhang(S.C. Li, M.J. Zhang, On the signless Laplacian index of cacti with a given number of pendant vetices, Linear Algebra Appl. 436, 2012, 4400--4411). Further, we characterize the unique graph with the maximum signless Laplacian spectral radius among all cacti on $n$ vertices.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
