Related papers: Energies of Hypergraphs
We introduce a new operation on a class of graphs with the property that the Laplacian eigenvalues of the input and output graphs are related. Based on this operation, we obtain a family of order (square root of n) noncospectral unicyclic…
In this paper we compute bounds for signless Laplacian energy, distance signless Laplacian eigenvalues and signless Laplacian energy of unitary addition Cayley graph G_{n}. We also obtain distance Laplacian eigenvalues and distance…
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…
For a simple graph $G=(V,E)$ with eigenvalues of the adjacency matrix $\lambda_{1}\geq\lambda_{2}\geq\cdots\geq\lambda_{n}$, the energy of the graph is defined by $E(G)=\sum_{j=1}^{n}|\lambda_{j}|$. Myriads of papers have been published in…
For a given hypergraph, an orientation can be assigned to the vertex-edge incidences. This orientation is used to define the adjacency and Laplacian matrices. In addition to studying these matrices, several related structures are…
In this paper, we investigate spectral properties of the adjacency tensor, Laplacian tensor and signless Laplacian tensor of general hypergraphs (including uniform and non-uniform hypergraphs). We obtain some bounds for the spectral radius…
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…
In this article we examine the adjacency and Laplacian matrices and their eigenvalues and energies of the general product (non-complete extended $p$-sum, or NEPS) of signed graphs. We express the adjacency matrix of the product in terms of…
In this paper, we determine the Randic' energy of the m-splitting graph, the m-shadow graph and the m-duplicate graph of a given graph, m being an arbitrary integer. Our results allow the construction of an infinite sequence of graphs…
A complex unit hypergraph is a hypergraph where each vertex-edge incidence is given a complex unit label. We define the adjacency, incidence, Kirchoff Laplacian and normalized Laplacian of a complex unit hypergraph and study each of them.…
The $d$-th order Laplacian spectral moment of a $k$-uniform hypergraph is the sum of the $d$-th powers of all eigenvalues of its Laplacian tensor. In this paper, we obtain some expressions of the Laplacian spectral moments for $k$-uniform…
For a $k$-uniform hypergraph $H$, we obtain some trace formulas for the Laplacian tensor of $H$, which imply that $\sum_{i=1}^nd_i^s$ ($s=1,\ldots,k$) is determined by the Laplacian spectrum of $H$, where $d_1,\ldots,d_n$ is the degree…
The Laplacian energy of a graph is the sum of the distances of the eigenvalues of the Laplacian matrix of the graph to the graph's average degree. The maximum Laplacian energy over all graphs on $n$ nodes and $m$ edges is conjectured to be…
The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study the energy of integral circulant graphs, also called gcd graphs, which can be characterized by their vertex count $n$ and a set $\cal D$ of…
Let $G$ be a simple graph with vertex set $V(G) = \{v_1, v_2,\ldots, v_n\}$ and edge set $E(G) = \{e_1, e_2,\ldots, e_m\}$. Similar to the Randi\'c matrix, here we introduce the Randi\'c incidence matrix of a graph $G$, denoted by $I_R(G)$,…
The energy of a graph is defined as the sum the absolute values of the eigenvalues of its adjacency matrix. A graph G on n vertices is said to be borderenergetic if its energy equals the energy of the complete graph Kn. In this paper, we…
We study $\Gamma$-convergence of graph Dirichlet energies and spectral convergence of graph Laplacians on unions of intersecting manifolds of potentially different dimensions. Our investigation is motivated by problems of machine learning,…
In this paper we give new bounds for a several vertex-based and edge-based topological indices of graphs: Albertson irregularity index, degree variance index, Mostar and the first Zagreb index. Moreover, we give a new upper bound for the…
The graph entropy describes the structural information of graph. Motivated by the definition of graph entropy in general graphs, the graph entropy of hypergraphs based on Laplacian degree are defined. Some results on graph entropy of simple…
The power graph $P(\Omega)$ of a group $\Omega$ is a graph with the vertex set $\Omega$ such that two distinct vertices form an edge if and only if one of them is an integral power of the other. In this article, we determine the power graph…