相关论文: Laplacian eigenvalues of equivalent cographs

An edge-weighted graph $G$, possibly with loops, is said to be antiferromagnetic if it has nonnegative weights and at most one positive eigenvalue, counting multiplicities. The number of graph homomorphisms from a graph $H$ to an…

We extend the results given by Colbois, Dryden and El Soufi on the relationships between the eigenvalues of the Laplacian and an extrinsic invariant called intersection index, in two directions. First, we replace this intersection index by…

We derive upper bounds for the eigenvalues of the Kirchhoff Laplacian on a compact metric graph depending on the graph's genus g. These bounds can be further improved if $g = 0$, i.e. if the metric graph is planar. Our results are based on…

We present sharp inequalities relating the number of vertices, edges, and triangles of a graph to the smallest eigenvalue of its adjacency matrix and the largest eigenvalue of its Laplacian.

In this paper, we propose algorithms for the graph isomorphism (GI) problem that are based on the eigendecompositions of the adjacency matrices. The eigenvalues of isomorphic graphs are identical. However, two graphs $ G_A $ and $ G_B $ can…

We derive various eigenvalue estimates for the Hodge Laplacian acting on differential forms on weighted Riemannian manifolds. Our estimates unify and extend various results from the literature and we provide a number of geometric…

We prove that ample groupoids with sigma-compact unit spaces are equivalent if and only if they are stably isomorphic in an appropriate sense, and relate this to Matui's notion of Kakutani equivalence. We use this result to show that…

Fix $m \in \mathbb N$. A new generalization of the $H$-join operation of a family of graphs $\{G_1, G_2, \dots, G_k\}$ constrained by indexing maps $I_1,I_2,\dots,I_k$ is introduced as $H_m$-join of graphs, where the maps $I_i:V(G_i)$ to…

We show that for any compact connected group G the second cohomology group defined by unitary invariant 2-cocycles on \hat G is canonically isomorphic to H^2(\hat{Z(G)};T). This implies that the group of autoequivalences of the C*-tensor…

{Signless Laplacian determinations of some graphs with independent edges}% {Let $G$ be a simple undirected graph. Then the signless Laplacian matrix of $G$ is defined as $D_G + A_G$ in which $D_G$ and $A_G$ denote the degree matrix and the…

In this note we give a new upper bound for the Laplacian eigenvalues of an unweighted graph. Let $G$ be a simple graph on $n$ vertices. Let $d_{m}(G)$ and $\lambda_{m+1}(G)$ be the $m$-th smallest degree of $G$ and the $m+1$-th smallest…

Let i be a homomorphism of the multiplicative group into a connected reductive algebraic group over C. Let G^i be the centralizer of the image i. Let LG be the Lie algebra of G and let L_nG (n integer) be the summands in the direct sum…

Learning a suitable graph is an important precursor to many graph signal processing (GSP) pipelines, such as graph spectral signal compression and denoising. Previous graph learning algorithms either i) make some assumptions on connectivity…

Let (M,g) be a compact Riemannian manifold of dimension >2. We show that there is a metric h conformal to g and of volume 1 such that the first positive eigenvalue the conformal Laplacian with repect to h is arbitrarily large. A similar…

In this article we give a geometrical description of the (in general non-selfadjoint) in/out Laplacian $\mathcal{L}^{+/-} = (d^{+/-})^* d$ and adjacency matrix on digraphs with arbitrary weights, where $(d^{+/-})^*$ is the adjoint of the…

Let G be any group and F an algebraically closed field of characteristic zero. We show that any G-graded finite dimensional associative G-simple algebra over F is determined up to a G-graded isomorphism by its G-graded polynomial…

Let G be a graph, H be its chromatic number, L be the largest eigenvalue of its Laplacian, and M be the largest eigenvalue of its adjacency matrix. Then, complementing a well-known result of Hoffman, we show that L>=(H/(H-1))M

We consider associative algebras L over a field provided with a direct sum decomposition of a two-sided ideal M and a sub-algebra A - examples are provided by trivial extensions or triangular type matrix algebras. In this relative and split…

We prove that if a field k is infinite, char(k)=0 and k has not nontrivial automorphisms then automorphic equivalence of representations of Lie algebras coincide with geometric equivalence. We achieve our result by consideration of 1-sorted…

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 their symmetric difference is a pair of adjacent vertices in $G$. In this article, we…