相关论文: Garland's method for token graphs

A connected graph $G$ with at least $2m+2n+2$ vertices is said to have property $E(m,n)$ if, for any two disjoint matchings $M$ and $N$ of size $m$ and $n$ respectively, $G$ has a perfect matching $F$ such that $M\subseteq F$ and $N\cap…

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…

Laplacian eigenvectors capture natural community structures on graphs and are widely used in spectral clustering and manifold learning. The use of Laplacian eigenvectors as embeddings for the purpose of multiscale graph comparison has…

Let $G$ be a simple graph, $A(G)$ its adjacency matrix, and $D(G)$ its diagonal degree matrix. In 2022, \citeauthor{Wang2020} (\cite{Wang2020}) defined the family of matrices $L_\alpha$ as the convex linear combination: \[ L_\alpha(G) =…

The purpose of this paper is to introduce and study the following graph theoretic paradigm. Let $$T_Kf(x)=\int K(x,y) f(y) d\mu(y),$$ where $f: X \to {\Bbb R}$, $X$ a set, finite or infinite, and $K$ and $\mu$ denote a suitable kernel and a…

For a graph with $n$ vertices and $m$ edges, having Laplacian spectrum $\mu_1, \mu_2, \cdots,\mu_n$ and signless Laplacian spectrum $\mu^+_1,\mu^+_2, \cdots,\mu^+_n$, the Laplacian energy and signless Laplacian energy of $G$ are…

Let $Q(G)=D(G)+A(G)$ be the signless Laplacian matrix of a simple graph $G$, where $D(G)$ and $A(G)$ are the degree diagonal matrix and the adjacency matrix of $G$, respectively. The largest eigenvalue of $Q(G)$, denoted by $q(G)$, is…

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…

Given a finite simple graph $G$ on $m$ vertices, the zeon combinatorial Laplacian $\Lambda$ of $G$ is an $m\times m$ graph having entries in the complex zeon algebra $\mathbb{C}\mathfrak{Z}$. It is shown here that if the graph has a unique…

The generalized power of a simple graph $G$, denoted by $G^{k,s}$, is obtained from $G$ by blowing up each vertex into an $s$-set and each edge into a $k$-set, where $1 \le s \le \frac{k}{2}$. When $s < \frac{k}{2}$, $G^{k,s}$ is always…

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…

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…

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…

If $G$ is a graph, its Laplacian is the difference between diagonal matrix of its vertex degrees and its adjacency matrix. A one-edge connection of two graphs $G_{1}$ and $G_{2}$ is a graph $G=G_{1}\odot G_{2}$ with $V(G)=V(G_{1})\cup…

Let $G$ be a connected graph with vertex set $V(G)$ and edge set $E(G)$. Let $Tr(G)$ be the diagonal matrix of vertex transmissions of $G$ and $D(G)$ be the distance matrix of $G$. The distance Laplacian matrix of $G$ is defined as…

Let $n$, $k$ and $l$ be integers with $1\leq k<l\leq n-1$. The set-inclusion graph $G(n,k,l)$ is the graph whose vertex set consists of all $k$- and $l$-subsets of $[n]=\{1,2,\ldots,n\}$, where two distinct vertices are adjacent if one of…

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,…

An $L(2,1)$-labeling of a graph $G=(V,E)$ is a function $f$ from the vertex set $V(G)$ to the set of nonnegative integers such that the labels on adjacent vertices differ by at least two, and the labels on vertices at distance two differ by…

Let $A(G)$ and $D(G)$ be the adjacency matrix and the degree diagonal matrix of a graph $G$, respectively. Then $L(G)=D(G)-A(G)$ is called Laplacian matrix of the graph $G$. Let $G$ be a graph with $n$ vertices and $m$ edges. Then the…

For $l > 1$, the $l$-edge-connectivity $\kappa'_l(G)$ of a connected graph $G$ is defined as the minimum number of edges whose removal leaves a graph with at least $l$ components. A graph is minimally $(k,l)$-edge-connected if…