Related papers: Eigenvalues of Hypergraph Products and Reciprocal …
This paper introduces four types of subdivision products for simple directed graphs extending those from the undirected case, in particular, the subdivision-vertex join, subdivision-arc join, subdivision-vertex corona and subdivision-arc…
In this paper, we investigate the spectral properties of the closed neighborhood corona product of graphs, which was introduced by Harishchandra S. Ramane et al.~\cite{ramane2021polynomials} (cf. Polynomials Associated with Closed…
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) =…
We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…
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…
In this paper, we investigate the spectral properties of Andr\'asfai graphs, focusing on key parameters: the second-largest and smallest eigenvalues, the number of distinct eigenvalues, and the multiplicities of the eigenvalues 1 and -1.…
We present a systematic collection of spectral surgery principles for the Laplacian on a metric graph with any of the usual vertex conditions (natural, Dirichlet or $\delta$-type), which show how various types of changes of a local or…
In the first part of this manuscript a relationship between the spectrum of self-adjoint operator matrices and the spectra of their diagonal entries is found. This leads to enclosures for spectral points and in particular, enclosures for…
It is reported that dynamical systems over digraphs have superior performance in terms of system damping and tolerance to time delays if the underlying graph Laplacian has a purely real spectrum. This paper investigates the topological…
This paper introduces the concept of $\mu$-signed and duplication signed graphs and shows that both are always structurally balanced. Using the duplication signed graph, we define the corona product of the duplication signed graph…
This review presents an account of the major works done on spectra of adjacency matrices drawn on networks and the basic understanding attained so far. We have divided the review under three sections: (a) extremal eigenvalues, (b) bulk part…
The eigenvalues of the Laplacian matrix for a class of directed graphs with both positive and negative weights are studied. First, a class of directed signed graphs is investigated in which one pair of nodes (either connected or not) is…
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…
We consider finite graphs whose vertexes are supersingular elliptic curves, possibly with level structure, and edges are isogenies. They can be applied to the study of modular forms and to isogeny based cryptography. The main result of this…
On finite metric graphs we consider Laplace operators, subject to various classes of non-self-adjoint boundary conditions imposed at graph vertices. We investigate spectral properties, existence of a Riesz basis of projectors and similarity…
We show that for threshold graphs, the eigenvalues of the signless Laplacian matrix interlace with the degrees of the vertices. As an application, we show that the signless Brouwer conjecture holds for threshold graphs, i.e., for threshold…
Nonlinear spectral graph theory is an extension of the traditional (linear) spectral graph theory and studies relationships between spectral properties of nonlinear operators defined on a graph and topological properties of the graph…
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…
The study of hypergraphs has received a lot of attention over the past few years, however up until recently there has been no interest in systems where higher order interactions are not undirected. In this article we introduce the notion of…
In this paper, we investigate some relations between the invariants (including vertex and edge connectivity and forwarding indices) of a graph and its Laplacian eigenvalues. In addition, we present a sufficient condition for the existence…