Related papers: New matrices for spectral hypergraph theory, II
Learning a graph with a specific structure is essential for interpretability and identification of the relationships among data. It is well known that structured graph learning from observed samples is an NP-hard combinatorial problem. In…
A Laplacian matrix is a square real matrix with nonpositive off-diagonal entries and zero row sums. As a matrix associated with a weighted directed graph, it generalizes the Laplacian matrix of an ordinary graph. A standardized Laplacian…
We give a combinatorial characterization of graphs whose normalized Laplacian has three distinct eigenvalues. Strongly regular graphs and complete bipartite graphs are examples of such graphs, but we also construct more exotic families of…
There is a deep and interesting connection between the topological properties of a graph and the behaviour of the dynamical system defined on it. We analyse various kind of graphs, with different contrasting connectivity or degree…
Representing graphs as quantum states is becoming an increasingly important approach to study entanglement of mixed states, alternate to the standard linear algebraic density matrix-based approach of study. In this paper, we propose a…
A new class of isospectral graphs is presented. These graphs are isospectral with respect to both the normalised Laplacian on the discrete graph and the standard differential Laplacian on the corresponding metric graph. The new class of…
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…
Because of the significant increase in size and complexity of the networks, the distributed computation of eigenvalues and eigenvectors of graph matrices has become very challenging and yet it remains as important as before. In this paper…
We study the symmetry properties of the spectra of normalized Laplacians on signed graphs. We find a new machinery that generates symmetric spectra for signed graphs, which includes bipartiteness of unsigned graphs as a special case.…
The aim of the present article is to give an overview of spectral theory on metric graphs guided by spectral geometry on discrete graphs and manifolds. We present the basic concept of metric graphs and natural Laplacians acting on it and…
The eigenvalues of the normalized Laplacian of a graph provide information on its topological and structural characteristics and also on some relevant dynamical aspects, specifically in relation to random walks. In this paper we determine…
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) =…
Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on…
A complex unit gain graph ($ \mathbb{T} $-gain graph), $ \Phi=(G, \varphi) $ is a graph where the function $ \varphi $ assigns a unit complex number to each orientation of an edge of $ G $, and its inverse is assigned to the opposite…
In this paper, we introduce the class of cored hypergraphs and power hypergraphs, and investigate the properties of their Laplacian H-eigenvalues. From an ordinary graph, one may generate a $k$-uniform hypergraph, called the $k$th power…
A $k$-uniform hypergraph $G=(V,E)$ is called odd-bipartite ([5]), if $k$ is even and there exists some proper subset $V_1$ of $V$ such that each edge of $G$ contains odd number of vertices in $V_1$. Odd-bipartite hypergraphs are…
In the first part of this paper, we survey results that are associated with three types of Laplacian matrices:difference, normalized, and signless. We derive eigenvalue and eigenvector formulaes for paths and cycles using circulant matrices…
We characterize when the spectral variation of the signed Laplacian matrices is integral after a new edge is added to a signed graph. As an application, for every fixed signed complete graph, we fully characterize the class of signed graphs…
We study entanglement properties of mixed density matrices obtained from combinatorial Laplacians. This is done by introducing the notion of the density matrix of a graph. We characterize the graphs with pure density matrices and show that…
We investigate connections between the symmetries (automorphisms) of a graph and its spectral properties. Whenever a graph has a symmetry, i.e. a nontrivial automorphism $\phi$, it is possible to use $\phi$ to decompose any matrix…