Related papers: Spectra of three-peg Hanoi towers graphs
We consider the damped wave semigroup on the tadpole graph ${\mathcal R}$. We first give a meticulous spectral analysis, followed by a judicious decomposition of the resolvent's kernel. As a consequence, and by showing that the generalized…
The eigenvalues of the normalized Laplacian matrix of a network plays an important role in its structural and dynamical aspects associated with the network. In this paper, we study the spectra and their applications of normalized Laplacian…
Despite of the extreme success of the spectral graph theory, there are relatively few papers applying spectral analysis to hypergraphs. Chung first introduced Laplacians for regular hypergraphs and showed some useful applications. Other…
Spectral approaches of network analysis heavily rely upon the eigendecomposition of the graph Laplacian. For instance, in graph signal processing, the Laplacian eigendecomposition is used to define the graph Fourier transform and then…
We present a new approach to the theory of k-forms on self-similar fractals. We work out the details for two examples, the standard Sierpinski gasket and the 3-dimensional Sierpinski gasket, but the method is expected to be effective for…
In this paper, we determine the two normalized Laplacian spectrum of generalized subdivision- vertex corona, subdivision-edge corona for a connected regular graph with an arbitrary reg- ular graph in terms of their normalized Laplacian…
In this survey article, we investigate the spectral properties of fractal differential operators on self-similar fractals. In particular, we discuss the decimation method, which introduces a renormalization map whose dynamics describes the…
Spectral hypergraph theory mainly concerns using hypergraph spectra to obtain structural information about the given hypergraphs. The study of cospectral hypergraphs is important since it reveals which hypergraph properties cannot be…
Analysis of signals defined on complex topologies modeled by graphs is a topic of increasing interest. Signal decomposition plays a crucial role in the representation and processing of such information, in particular, to process graph…
In this paper, we introduce central vertex corona, central edge corona, and central edge neighborhood corona of graphs using central graph. Also, we determine their adjacency spectrum, Laplacian spectrum and signless Laplacian spectrum.…
Let $G$ be graph on $n$ vertices and $G^{(t)}$ its blow-up graph of order $t.$ In this paper, we determine all eigenvalues of the Laplacian and the signless Laplacian matrix of $G^{(t)}$ and its complement $\bar{G^{(t)}}.$
One of the more challenging tasks in the understanding of dynamical properties of models on top of complex networks is to capture the precise role of multiplex topologies. In a recent paper, Gomez et al. [Phys. Rev. Lett. 101, 028701…
We propose an approach to graph sparsification based on the idea of preserving the smallest $k$ eigenvalues and eigenvectors of the Graph Laplacian. This is motivated by the fact that small eigenvalues and their associated eigenvectors tend…
We numerically construct the spectrum of the Laplacian on Page's inhomogeneous Einstein metric on $\mathbb{CP}^2 \# \overline{\mathbb{CP}}^2$ by reducing the problem to a (singular) Sturm-Liouville problem in one dimension. We perform a…
We introduce a zeta function of digraphs that determines, and is determined by, the spectra of all linear combinations of the adjacency matrix, its transpose, the out-degree matrix, and the in-degree matrix. In particular, zeta-equivalence…
Let $G$ be a connected graph of order $n$, and $A(G)$ and $D(G)$ its adjacency and degree diagonal matrices, respectively. For a parameter $\alpha \in [0,1]$, Nikiforov~(2017) introduced the convex combination $A_{\alpha}(G) = \alpha D(G) +…
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…
The graphs with all equal negative or positive eigenvalues are special kind in the spectral graph theory. In this article, several iterated line graphs $\mathcal{L}^k(G)$ with all equal negative eigenvalues $-2$ are characterized for $k\ge…
The study and calculation of spectrum of networks can be used to describe networks structure and quantify analysis of networks performance. The fractal M\"{o}bius octagonal networks, denoted by $Q_n$, is derived from the inverse…
In this work, we develop a spectral theory for hypergraph limits. We prove the convergence of the spectra of adjacency and Laplacian matrices for hypergraph sequences converging in the $1$-cut metric. On the other hand, we give examples of…