相关论文: The largest normalized Laplacian eigenvalue and in…

Fix positive numbers $\alpha$ and $\beta$. For the family of doubly cyclic matrices of the form $diag(a_1, a_2, ... ,a_n) - diag(b_1, b_2, ... ,b_n) \Sigma_*$, where $\Sigma_*$ is a permutation matrix for the $n$-cycle $1 \to 2$, $2 \to 3$,…

A number of recent papers have considered signed graph Laplacians, a generalization of the classical graph Laplacian, where the edge weights are allowed to take either sign. In the classical case, where the edge weights are all positive,…

Jiang, Tidor, Yao, Zhang, and Zhao recently showed that connected bounded degree graphs have sublinear second eigenvalue multiplicity (always referring to the adjacency matrix). This result was a key step in the solution to the problem of…

Bollob\'as and Nikiforov [J. Combin. Theory, Ser. B. 97 (2007) 859--865] conjectured the following. If $G$ is a $K_{r+1}$-free graph on at least $r+1$ vertices and $m$ edges, then $\lambda^2_1(G)+\lambda^2_2(G)\leq \frac{r-1}{r}\cdot2m$,…

For an $n \times n$ matrix $A$, let $q(A)$ be the number of distinct eigenvalues of $A$. If $G$ is a connected graph on $n$ vertices, let $\mathcal{S}(G)$ be the set of all real symmetric $n \times n$ matrices $A=[a_{ij}]$ such that for…

The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…

An independent dominating set of a graph, also known as a maximal independent set, is a set $S$ of pairwise non-adjacent vertices such that every vertex not in $S$ is adjacent to some vertex in $S$. We prove that for $\Delta=4$ or…

Spectral clustering is a well-known technique which identifies $k$ clusters in an undirected graph with weight matrix $W\in\mathbb{R}^{n\times n}$ by exploiting its graph Laplacian $L(W)$, whose eigenvalues $0=\lambda_1\leq \lambda_2 \leq…

Let $k$ and $l$ be integers, both at least 2. A $(k,l)$-bipartite graph is an $l$-regular bipartite multigraph with coloured bipartite sets of size $k$. Define $\chi(k,l)$ and $\mu(k,l)$ to be the minimum and maximum order of automorphism…

Let G be a simple graph on $n$ vertices and $e(G)$ edges. Consider $Q(G) = D + A$ as the signless Laplacian of $G$, where $A$ is the adjacency matrix and $D$ is the diagonal matrix of the vertices degree of $G$. Let $q_1(G)$ and $q_2(G)$ be…

We give a construction of a class of magnetic Laplacian operators on finite directed graphs. We study some general combinatorial and algebraic properties of operators in this class before applying the Harrell-Stubbe Averaged Variational…

A graph is called "Laplacian integral" if the eigenvalues of its Laplacian matrix are all integers. We investigate the subset of these graphs whose Laplacian is furthermore diagonalized by a matrix with entries coming from a fixed set, in…

We propose the notion of normalized Laplacian matrix $\mathcal{L}(\Phi)$ for a gain graphs and study its properties in detail, providing insights and counterexamples along the way. We establish bounds for the eigenvalues of…

For graphs $G$ and $H$, an $H$-coloring of $G$ is a map from the vertices of $G$ to the vertices of $H$ that preserves edge adjacency. We consider the following extremal enumerative question: for a given $H$, which connected $n$-vertex…

In this paper, we aim to study the smallest normalized signless $\infty$-Laplacian eigenvalue $\mu_{\infty}$, a generalisation of the smallest signless Laplacian eigenvalue. For a non-bipartite connected graph, we show that the invariant…

We give an upper bound on the maximal eigenvalue of the adjacency matrix of a connected graph in terms of its maximum degree, diameter and order. This bound is best possible up to a constant factor and improves prevoius results of…

In this work, we obtain the first upper bound on the multiplicity of Laplacian eigenvalues for negatively curved surfaces which is sublinear in the genus g. Our proof relies on a trace argument for the heat kernel, and on the idea of…

The signless Laplacian matrix of a graph $G$ is defined to be the sum of its adjacency matrix and degree diagonal matrix, and its eigenvalues are called $Q$-eigenvalues of $G$. A $Q$-eigenvalue of a graph $G$ is called a $Q$-main eigenvalue…

Let $\mathcal{G}(n,k)$ be the set of connected graphs of order $n$ with one of the Laplacian eigenvalue having multiplicity $k$. It is well known that $\mathcal{G}(n,n-1)=\{K_n\}$. The graphs of $\mathcal{G}(n,n-2)$ are determined by Das,…

The second largest eigenvalue of a graph is an important algebraic parameter which is related with the expansion, connectivity and randomness properties of a graph. Expanders are highly connected sparse graphs. In coding theory, Expander…