相关论文: Energies of Hypergraphs

The energy of a graph $G$ is the sum of the absolute values of the eigenvalues of the adjacency matrix of $G$. Some variants of energy can also be found in the literature which are defined on the concepts of Laplacian matrix, Distance…

We apply eigenvalue interlacing techniques for obtaining lower and upper bounds for the sums of Laplacian eigenvalues of graphs, and characterize equality. This leads to generalizations of, and variations on theorems by Grone, and Grone and…

We study the sets of inertias achieved by Laplacian matrices of weighted signed graphs. First we characterize signed graphs with a unique Laplacian inertia. Then we show that there is a sufficiently small perturbation of the nonzero weights…

Let $\mu_1\ge \mu_2\ge\cdots\ge\mu_n$ denote the Laplacian eigenvalues of $G$ with $n$ vertices. The Laplacian-energy-like invariant, denoted by $LEL(G)= \sum_{i=1}^{n-1}\sqrt{\mu_i}$, is a novel topological index. In this paper, we show…

Typically, graph structures are represented by one of three different matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. The spectral (eigenvalue) properties of these different matrices are…

For a graph $G$ and a non-zero real number $\alpha$, the graph invariant $S_{\alpha}(G)$ is the sum of the $\alpha^{th}$ power of the non-zero signless Laplacian eigenvalues of $G$. In this paper, we obtain the sharp bounds of…

We analyze graphs attaining the extreme values of various spectral indices in the class of all simple connected graphs, as well as in the class of graphs which are not complete multipartite graphs. We also present results on density of…

A signed graph $\Gamma(G)$ is a graph with a sign attached to each of its edges, where $G$ is the underlying graph of $\Gamma(G)$. The energy of a signed graph $\Gamma(G)$ is the sum of the absolute values of the eigenvalues of the…

Minimal surfaces in $\mathbb{R}^n$ can be locally approximated by graphs of harmonic functions, i.e., functions that are critical points of the Dirichlet energy, but no analogous theorem is known for $H$-minimal surfaces in the…

In this paper, we introduce the notion of an energy graph as a simple, directed and vertex labeled graph $G$ such that the arcs $(v_i, v_j) \notin A(G)$ if $i > j$ for all distinct pairs $v_i,v_j$ and at least one vertex $v_k$ exists such…

We propose a simple and natural definition for the Laplacian and the signless Laplacian tensors of a uniform hypergraph. We study their H$^+$-eigenvalues, i.e., H-eigenvalues with nonnegative H-eigenvectors, and H$^{++}$-eigenvalues, i.e.,…

Let $H=(V,E)$ be an $r$-uniform hypergraph with the vertex set $V$ and the edge set $E$. For $1\leq s \leq r/2$, we define a weighted graph $G^{(s)}$ on the vertex set ${V\choose s}$ as follows. Every pair of $s$-sets $I$ and $J$ is…

It is generally believed that, in the thermodynamic limit, the microcanonical description as a function of energy coincides with the canonical description as a function of temperature. However, various examples of systems for which the…

In this article we consider the spectrum of a Laplacian matrix, also known as the Markov matrix, under the independence assumption. We assume that the entries have a variance profile. Motivated by recent works on generalized Wigner matrices…

For a simple graph on $n$ vertices, any of its signless Laplacian eigenvalues is in the interval $[0, 2n-2]$. In this paper, we give relationships between the number of signless Laplacian eigenvalues in specific intervals in $[0, 2n-2]$ and…

We introduce Graph Hopfield Networks, whose energy function couples associative memory retrieval with graph Laplacian smoothing for node classification. Gradient descent on this joint energy yields an iterative update interleaving Hopfield…

Normalized Laplacian matrices of graphs have recently been studied in the context of quantum mechanics as density matrices of quantum systems. Of particular interest is the relationship between quantum physical properties of the density…

The energy of a vertex $v_i$ in a graph $G$ is defined as $\mathcal{E}_G(v_i) = |A|_{ii}$, where $A$ is the adjacency matrix of $G$, $A^*$ denotes the conjugate transpose of $A$, and $|A| = (AA^*)^{1/2}$. The total energy of the graph,…

Let $G$ be a simple graph of order $n$ with degree sequence $(d)=(d_1,d_2,\ldots,d_n)$ and conjugate degree sequence $(d^*)=(d_1^*,d_2^*,\ldots,d_n^*)$. In \cite{AkbariGhorbaniKoolenObudi2010,DasMojallalGutman2017} it was proven that…

The eccentricity matrix of a simple connected graph is derived from its distance matrix by preserving the largest non-zero distance in each row and column, while the other entries are set to zero. This article examines the…