相关论文: Proof of a conjecture on `plateaux' phenomenon of …

Let $G$ be a graph with $p(G)$ pendant vertices and $q(G)$ quasi-pendant vertices. Denote by $m_{L(G)}(\lambda)$ the multiplicity of $\lambda$ as a Laplacian eigenvalue of $G$. Let $\overline{G}$ be the reduced graph of $G$, which can be…

Let $G$ be a simple graph with $n$ vertices and $e(G)$ edges, and $q_1(G)\geq q_2(G)\geq\cdots\geq q_n(G)\geq0$ be the signless Laplacian eigenvalues of $G.$ Let $S_k^+(G)=\sum_{i=1}^{k}q_i(G),$ where $k=1, 2, \ldots, n.$ F. Ashraf et al.…

Let $M=[m_{ij}]$ be an $n\times m$ real matrix, $\rho$ be a nonzero real number, and $A$ be a symmetric real matrix. We denote by $D(M)$ the $n\times n$ diagonal matrix $diag(\sum_{j=1}^{m}m_{1j},\ldots,\sum_{j=1}^{m}m_{nj})$ and denote by…

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$.…

The work in this thesis concerns the investigation of eigenvalues of the Laplacian matrix, normalized Laplacian matrix, signless Laplacian matrix and distance signless Laplacian matrix of graphs. In Chapter 1, we present a brief…

Let $\tau(G)$ and $\kappa'(G)$ denote the edge-connectivity and the spanning tree packing number of a graph $G$, respectively. Proving a conjecture initiated by Cioaba and Wong, Liu et al. in 2014 showed that for any simple graph $G$ with…

For some positive integer $k$, if the finite cyclic group $\mathbb{Z}_k$ can act freely on a graph $G$, then we say that $G$ is $k$-symmetric. In 1985, Faria showed that the multiplicity of Laplacian eigenvalue 1 is greater than or equal to…

Let $G$ be a simple connected graph. If every pendant path in $G$ is at least $P_s$, we denote that $G\in \mathbb{G}_s$. For $G \in \mathbb{G}_s$, let $Q_s(G)$ be the set of vertices in $G$ that are distance $s$ from the pendant vertex, and…

Let $G$ be a simple graph with the Laplacian matrix $L(G)$ and let $e(G)$ be the number of edges of $G$. A conjecture by Brouwer and a conjecture by Grone and Merris state that the sum of the $k$ largest Laplacian eigenvalues of $G$ is at…

Ahanjideh, Akbari, Fakharan and Trevisan proposed a conjecture in [Linear Algebra Appl. 632 (2022) 1--14] on the distribution of the Laplacian eigenvalues of graphs: for any connected graph of order $n$ with diameter $d\ge 2$ that is not a…

A path decomposition of a graph $G$ is a collection of edge-disjoint paths of $G$ that covers the edge set of $G$. Gallai (1968) conjectured that every connected graph on $n$ vertices admits a path decomposition of cardinality at most…

Let $k$ be a positive integer and let $G$ be a simple graph of order $n$ with minimum degree $\delta$. A graph $G$ is said to have property $P(k, d)$ if it contains $k$ edge-disjoint spanning trees and an additional forest $F$ with edge…

Let $\lambda_{i}(G)$ be the $i$-th largest Laplacian eigenvalues of graph $G$, where $1\le i\le |V(G)|$. Liu, Yuan, You and Chen [Discrete Math., 341 (2018) 2969--2976] raised the problem for ``Which cospectral graphs have same degree…

We show that for threshold graphs, the eigenvalues of the signless Laplacian matrix interlace with the degrees of the vertices. As an application, we show that the signless Brouwer conjecture holds for threshold graphs, i.e., for threshold…

Let $G$ be a graph of order $n$. A path decomposition $\mathcal{P}$ of $G$ is a collection of edge-disjoint paths that covers all the edges of $G$. Let $p(G)$ denote the minimum number of paths needed in a path decomposition of $G$. Gallai…

Let $G$ be a simple connected graph on $n$ vertices and $m$ edges. In [Linear Algebra Appl. 435 (2011) 2570-2584], Lima et al. posed the following conjecture on the least eigenvalue $q_n(G)$ of the signless Laplacian of $G$: $\displaystyle…

It is conjectured that the Laplacian spectrum of a graph is majorized by its conjugate degree sequence. In this paper, we prove that this majorization holds for a class of graphs including trees. We also show that a generalization of this…

Let $\mathcal{A(}G\mathcal{)},\mathcal{L(}G\mathcal{)}$ and $\mathcal{Q(}% G\mathcal{)}$ be the adjacency tensor, Laplacian tensor and signless Laplacian tensor of uniform hypergraph $G$, respectively. Denote by $\lambda (\mathcal{T})$ the…

On a finite connected metric graph, we establish upper bounds for the eigenvalues of the Laplacian. These bounds depend on the length, the Betti number, and the number of pendant vertices. For trees, these estimates are sharp. We also…

For a graph \(G\) with no isolated vertices, its Laplacian ratio is defined as \[ \pi(G)=\frac{\operatorname{per}(L(G))}{\prod_{v\in V(G)} d(v)}, \] where \(L(G)\) is the Laplacian matrix of \(G\), \(d(v)\) is the degree of \(v\), and…