相关论文: Integral Laplacian graphs with a unique double Lap…

An eigenvalue of a graph $G$ is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. It is well known that a graph $G$ has exactly two main eigenvalues if and only if there exists a unique pair of…

We show that, with very high probability, the random graph Laplacian has simple spectrum. Our method provides a quantitatively effective estimate of the spectral gaps. Along the way, we establish results on affine no-gaps delocalization,…

For a simple connected graph $ G $ of order $ n $, the normalized Laplacian is a square matrix of order $ n $, defined as $\mathcal{L}(G)= D(G)^{-\frac{1}{2}}L(G)D(G)^{-\frac{1}{2}}$, where $ D(G)^{-\frac{1}{2}} $ is the diagonal matrix…

In this paper we investigate the reachability and observability properties of a network system, running a Laplacian based average consensus algorithm, when the communication graph is a path or a cycle. More in detail, we provide necessary…

Given an arbitrary connected $G$, the $n$-polygon graph $\tau_n(G)$ is obtained by adding a path with length $n$ $(n\geq 2)$ to each edge of graph $G$, and the iterated $n$-polygon graphs $\tau_n^g(G)$ ($g\geq 0$), is obtained from the…

The graphs with all equal negative or positive eigenvalues are special kind in the spectral graph theory. In this article, several iterated line graphs $\mathcal{L}^k(G)$ with all equal negative eigenvalues $-2$ are characterized for $k\ge…

In this paper we compute spectrum, Laplacian spectrum, signless Laplacian spectrum and their corresponding energies of commuting conjugacy class graph of the group $G(p, m, n) = \langle x, y : x^{p^m} = y^{p^n} = [x, y]^p = 1, [x, [x, y]] =…

We study the Laplacian spectrum of token graphs, also called symmetric powers of graphs. The $k$-token graph $F_k(G)$ of a graph $G$ is the graph whose vertices are the $k$-subsets of vertices from $G$, two of which being adjacent whenever…

The set of all non-increasing nonnegative integers sequence $\pi=$ ($d(v_1),$ $d(v_2),$ $...,$ $d(v_n)$) is denoted by $NS_n$. A sequence $\pi\in NS_n$ is said to be graphic if it is the degree sequence of a simple graph $G$ on $n$…

For given k distinct complex conjugate pairs, l distinct real numbers, and a given graph G on 2k+l vertices with a matching of size at least k, we will show that there is a real matrix whose eigenvalues are the given numbers and its graph…

Let $G$ be an unicyclic graph of order $n$ and let $Q_G(x)= det(xI-Q(G))={matrix} \sum_{i=1}^n (-1)^i \varphi_i x^{n-i}{matrix}$ be the characteristic polynomial of the signless Laplacian matrix of a graph $G$. We give some transformations…

Let $G$ be a connected graph with $n$ vertices. The isolated toughness of $G$, denoted by $I(G)$, is defined by $I(G)=\min\left\{\frac{|S|}{i(G-S)}:S\subseteq V(G) \ \mbox{and} \ i(G-S)\geq2\right\}$ if $G$ is not complete, or…

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…

We show that every $0$-$1$ multiplicity matrix for a simple graph $G$ is generically realisable for $G$. In particular, every multiplicity matrix for a path is generically realisable. We use this result to provide several families of joins…

In this paper, structural properties of chordal graphs are analysed, in order to establish a relationship between these structures and integer Laplacian eigenvalues. We present the characterization of chordal graphs with equal vertex and…

In this work we consider the Laplacian controllability of a graph constructed by interconnecting a finite number of single-input Laplacian controllable graphs. We first study the interconnection realized by the composite graph of two…

We develop eigenvalue estimates for the Laplacians on discrete and metric graphs using different types of boundary conditions at the vertices of the metric graph. Via an explicit correspondence of the equilateral metric and discrete graph…

Let G be a graph and let \Delta,\delta be the maximum and minimum degrees of G respectively, where \Delta/\delta<c<\sqrt{2} and c is a constant. In this paper we establish a sufficient spectral condition for the graph G to be Hamiltonian,…

In this paper we generalise the results on eigenvalues and eigenvectors of unnormalized (combinatorial) Laplacian of two-dimensional grid presented by Edwards:2013 first to a grid graph of any dimension, and second also to other types of…

A graph G is said to be M-integral (resp. A-integral, D-integral, DL-integral or DQ-integral) if all eigenvalues of its matrix M (resp. adjacency matrix A(G), distance matrix D(G), distance Laplacian matrix DL(G) or distance signless…