相关论文: On a conjecture of distance spectral extremal prob…

Let $m$ be a positive integer. Brualdi and Hoffman proposed the problem to determine the (connected) graphs with maximum spectral radius in a given graph class and they posed a conjecture for the class of graphs with given size $m$. After…

The spectral radius $\rho(G)$ of a graph $G$ is the largest eigenvalue of its adjacency matrix $A(G)$. For a fixed integer $e\ge 1$, let $G^{min}_{n,n-e}$ be a graph with minimal spectral radius among all connected graphs on $n$ vertices…

Spectral radius of a graph $G$ is the largest eigenvalue of adjacency matrix of $G$. The least eigenvalue of a graph $G$ is the least eigenvalue of adjacency matrix of $G$. In this paper we determine the graphs which attain respectively the…

Suppose that $G$ is a connected simple graph with the vertex set $V( G ) = \{ v_1,v_2,\cdots ,v_n \} $. Let $d( v_i,v_j ) $ be the distance between $v_i$ and $v_j$. Then the distance matrix of $G$ is $D( G ) =( d_{ij} )_{n\times n}$, where…

The spectral radius $\rho(G)$ of a graph $G$ is the largest eigenvalue of its adjacency matrix. Woo and Neumaier discovered that a connected graph $G$ with $\rho(G)\leq 3/2{\sqrt{2}}$ is either a dagger, an open quipu, or a closed quipu.…

In 1986, Brualdi and Solheid firstly proposed the problem of determining the maximum spectral radius of graphs in the set $\mathcal{H}_{n,m}$ consisting of all simple connected graphs with $n$ vertices and $m$ edges, which is a very tough…

In the past decades, many scholars concerned which edge-extremal problems have spectral analogues? Recently, Wang, Kang and Xue showed an interesting result on $F$-free graphs [J. Combin. Theory Ser. B 159 (2023) 20--41]. In this paper, we…

In this paper, we study a question of Hong from 1993 related to the minimum spectral radii of the adjacency matrices of connected graphs of given order and size. Hong asked if it is true that among all connected graphs of given number of…

Signed graphs have their edges labeled either as positive or negative. $\rho(M)$ denote the $M$-spectral radius of $\Sigma$, where $M=M(\Sigma)$ is a real symmetric graph matrix of $\Sigma$. Obviously,…

Let $G$ be a simple connected graph, and $D(G)$ be the distance matrix of $G$. Suppose that $D_{\max}(G)$ and $\lambda_1(G)$ are the maximum row sum and the spectral radius of $D(G)$, respectively. In this paper, we give a lower bound for…

Let $G$ be a simple connected graph of order $n$ and $D(G)$ be the distance matrix of $G.$ Suppose that $\lambda_{1}(D(G))\geq\lambda_{2}(D(G))\geq\cdots\geq\lambda_{n}(D(G))$ are the distance spectrum of $G$. A graph $G$ is said to be…

We prove two conjectures in spectral extremal graph theory involving the linear combinations of graph eigenvalues. Let $\lambda_1(G)$ be the largest eigenvalue of the adjacency matrix of a graph $G$, and $\bar{G}$ be the complement of $G$.…

Let $G$ be a graph with adjacency matrix $A(G)$ and let $D(G)$ be a diagonal matrix of the degrees of $G$. In 2017, Nikiforov defined the $A_{\alpha}$-matrix of $G$ as \begin{equation*} A_{\alpha}(G)=\alpha G)+(1-\alpha)A(G),…

Let $G$ be a graph with $n$ vertices and $m$ edges. The spectral radius $\rho(G)$ of $G$ is the largest eigenvalue of the adjacency matrix of $G$. As is well known, $\rho(G)\geq\frac{2m}{n}$ with equality if and only if $G$ is regular. To…

Let $G$ be a graph with adjacency matrix $A(G)$ and degree diagonal matrix $D (G)$. In 2017, Nikiforov defined the matrix $A_\alpha(G) = \alpha D(G) + (1-\alpha)A(G)$ for any real $\alpha\in[0,1]$. The largest eigenvalue of $A_\alpha(G)$ is…

Let $G$ be a graph with minimum degree $\delta$. The spectral radius of $G$, denoted by $\rho(G)$, is the largest eigenvalue of the adjacency matrix of $G$. In this note we mainly prove the following two results. (1) Let $G$ be a graph on…

Let $G$ be a connected graph with vertex set $V$. The distance, $d_G(u, v)$, between vertices $u$ and $v$ of $G$ is defined as the length of a shortest path between $u$ and $v$ in $G$. The distance matrix of $G$ is the matrix $\mathbf{D}(G)…

Liu, Hong, Gu, and Lai proved if the second largest eigenvalue of the adjacency matrix of graph $G$ with minimum degree $\delta \ge 2m+2 \ge 4$ satisfies $\lambda_2(G) < \delta - \frac{2m+1}{\delta+1}$, then $G$ contains at least $m+1$…

Let $G$ be a digraph with adjacency matrix $A(G)$. Let $D(G)$ be the diagonal matrix with outdegrees of vertices of $G$. Nikiforov \cite{Niki} proposed to study the convex combinations of the adjacency matrix and diagonal matrix of the…

Let $G$ be a graph with adjacency matrix $A(G)$ and degree diagonal matrix $D (G)$. In 2017, Nikiforov [Appl. Anal. Discrete Math., 11 (2017) 81--107] defined the matrix $A_\alpha(G) = \alpha D(G) + (1-\alpha)A(G)$ for any real…