相关论文: Edge-signed graphs with smallest eigenvalue greate…

The index of a signed graph is the largest eigenvalue of its adjacency matrix. For positive integers $n$ and $m\le n^2/4$, we determine the maximal index of complete signed graphs with $n$ vertices and $m$ negative edges. This settles (the…

A signed graph $\Sigma = (G, \sigma)$ is a graph where the function $\sigma$ assigns either $1$ or $-1$ to each edge of the simple graph $G$. The adjacency matrix of $\Sigma$, denoted by $A(\Sigma)$, is defined canonically. In a recent…

We characterize all connected graphs with second distance eigenvalue less than $-0.5858$.

In this paper, we classify distance regular graphs such that all of its second largest local eigenvalues are at most one. Also we discuss the consequences for the smallest eigenvalue of a distance-regular graph. These extend a result by the…

We classify the connected graphs with precisely three distinct eigenvalues and second largest eigenvalue at most 1.

We study the minimum number of distinct eigenvalues over a collection of matrices associated with a graph. Lower bounds are derived based on the existence or non-existence of certain cycle(s) in a graph. A key result proves that every…

Let $G$ be a simple graph with $n$ vertices and $\pm 1$-weights on edges. Suppose that for every edge $e$ the sum of edges adjacent to $e$ (including $e$ itself) is positive. Then the sum of weights over edges of $G$ is at least…

For a graph $G$, let $S_2(G)$ be the sum of the first two largest signless Laplacian eigenvalues of $G$, and $f(G)=e(G)+3-S_2(G)$. Oliveira, Lima, Rama and Carvalho conjectured that $K^+_{1,n-1}$ (the star graph with an additional edge) is…

An eigenvalue of the adjacency matrix of a graph is said to be \emph{main} if the all-1 vector is not orthogonal to the associated eigenspace. In this work, we approach the main eigenvalues of some graphs. The graphs with exactly two main…

This paper investigates the asymptotic nature of graph spectra when some edges of a graph are subdivided sufficiently many times. In the special case where all edges of a graph are subdivided, we find the exact limits of the $k$-th largest…

In 1979, Neumaier gave a bound on $\lambda$ in terms of $m$ and $\mu$, where $-m$ is the smallest eigenvalue of a primitive strongly regular graph, unless the graph in question belongs to one of the two infinite families of strongly regular…

We generalize three classical characterizations of line graphs to line graphs of signed and gain graphs: the Krausz's characterization, the van Rooij and Wilf's characterization and the Beineke's characterization. In particular, we present…

We characterize the simple connected graphs with the second largest eigenvalue less than 1/2, which consists of 13 classes of specific graphs. These 13 classes hint that $c_{2}\in [1/2, \sqrt{2+\sqrt{5}}]$, where $c_2$ is the minimum real…

Let $G$ be a connected (non-complete) $d$-regular graph with $d\geq3$. Let $c(G-S)$ denote the number of components of $G-S$ for any cut $S$ of $G$. The toughness $t(G)$ of $G$ is defined as $\min\left\{\frac{|S|}{c(G-S)}\right\}$, where…

For a graph $G$, let $S_2(G)$ be the sum of the first two largest signless Laplacian eigenvalues of $G$, and $f(G)=e(G)+3-S_2(G)$. Very recently, Zhou, He and Shan proved that $K^+_{1,n-1}$ (the star graph with an additional edge) is the…

In a signed graph $G$, an induced subgraph is called a negative clique if it is a complete graph and all of its edges are negative. In this paper, we give the characteristic polynomials and the eigenvalues of some signed graphs having…

A signed graph $G$ is a graph where each edge is assigned a + (positive edge) or a - (negative edge). The signed degree of a vertex $v$ in a signed graph, denoted by $sdeg(v)$, is the number of positive edges incident to $v$ subtracted by…

In 1975 Hoffman and Smith showed that for a graph $G\ne\tilde{D}_n$ with an internal path, the value of the largest eigenvalue decreases strictly each time we subdivide the internal path. In this paper we extend this result to show that for…

We prove a conjecture by Van Dam and Sotirov on the smallest eigenvalue of (distance-$j$) Hamming graphs and a conjecture by Karloff on the smallest eigenvalue of (distance-$j$) Johnson graphs. More generally, we study the smallest…

Given a graph $G$, let $\lambda_3$ denote the third largest eigenvalue of its adjacency matrix. In this paper, we prove various results towards the conjecture that $\lambda_3(G) \le \frac{|V(G)|}{3}$, motivated by a question of Nikiforov.…