Related papers: Eigenvalues of Hypergraph Products and Reciprocal …
Consider a semigraph $G=(V,\,E)$; in this paper, we study the eigenvalues of the Laplacian matrix of $G$. We show that the Laplacian of $G$ is positive semi-definite, and $G$ is connected if and only if $\lambda_2 >0.$ Along the similar…
A network's community structure commonly impacts its functions. For instance, networks seeking synchronisation will see this process follow the topology's hierarchical and community structuring. Herein, the interplay of network adjacency…
This article deals with the spectra of Laplacians of weighted graphs. In this context, two objects are of fundamental importance for the dynamics of complex networks: the second eigenvalue of such a spectrum (called algebraic connectivity)…
The reciprocal distance Laplacian matrix of a connected graph $G$ is defined as $RD^L(G)=RT(G)-RD(G)$, where $RT(G)$ is the diagonal matrix of reciprocal distance degrees and $RD(G)$ is the Harary matrix. Since $RD^L(G)$ is a real symmetric…
For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue inclusion sets. Using these bounds, first we derive bounds for the second largest and smallest eigenvalues of adjacency matrices of $k$-regular…
Let $G$ be a simple undirected connected graph with the Harary matrix $RD(G)$, which is also called the reciprocal distance matrix of $G$. The reciprocal distance signless Laplacian matrix of $G$ is $RQ(G)=RT(G)+RD(G)$, where $RT(G)$…
If $G$ is a graph, its Laplacian is the difference between diagonal matrix of its vertex degrees and its adjacency matrix. A one-edge connection of two graphs $G_{1}$ and $G_{2}$ is a graph $G=G_{1}\odot G_{2}$ with $V(G)=V(G_{1})\cup…
Here, we define a subdivision operation for a hypergraph and compute all the eigenvalues of the subdivision of regular and certain non-regular hypergraphs. In non-regular hypergraphs, we investigate the power of regular graphs, various…
In this article, various aspects of Laplacian spectra of power graphs of finite cyclic, dicyclic and finite $p$-groups are studied. Algebraic connectivity of power graphs of the above groups are considered and determined completely for that…
Network scientists have shown that there is great value in studying pairwise interactions between components in a system. From a linear algebra point of view, this involves defining and evaluating functions of the associated adjacency…
In this article, we introduce a geometric and a spectral preorder relation on the class of weighted graphs with a magnetic potential. The first preorder is expressed through the existence of a graph homomorphism respecting the magnetic…
The traditional adjacency matrix of a mixed graph is not symmetric in general, hence its eigenvalues may be not real. To overcome this obstacle, several authors have recently defined and studied various Hermitian adjacency matrices of…
In this note we elaborate on some notions of surface area for discrete graphs which are closely related to the inverse degree. These notions then naturally lead to associated connectivity measures of graphs and to the definition of a…
Motivated by the conjectures formulated in 2003 by Tun\c{c}el et al., we study interlacing properties of the eigenvalues of $A\otimes B + B\otimes A$ for pairs of $n$-by-$n$ matrices $A, B$. We prove that for every pair of symmetric…
In this paper, we give the relationship between spectral radius and local structures of graphs and hypergraphs. Our work shows that certain local subgraphs (subhypergraphs) must occur when the spectral radius ratio is large. We also give…
A certain signed adjacency matrix of the hypercube, which Hao Huang used last year to resolve the sensitivity conjecture, is closely related to the unique, 4-cycle free, 2-fold cover of the hypercube. We develop a framework in which this…
The spectral properties of signed directed graphs, which may be naturally obtained by assigning a sign to each edge of a directed graph, have received substantially less attention than those of their undirected and/or unsigned counterparts.…
We study the algebraic connectivity (or second Laplacian eigenvalue) of token graphs, also called symmetric powers of graphs. The $k$-token graph $F_k(G)$ of a graph $G$ is the graph whose vertices are the $k$-subsets of vertices from $G$,…
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…
In many areas such as computational biology, finance or social sciences, knowledge of an underlying graph explaining the interactions between agents is of paramount importance but still challenging. Considering that these interactions may…