Related papers: Unicyclic Graphs with equal Laplacian Energy
In this paper, we compute the Laplacian spectrum of non-commuting graphs of some classes of finite non-abelian groups. Our computations reveal that the non-commuting graphs of all the groups considered in this paper are L-integral. We also…
We propose the notion of normalized Laplacian matrix $\mathcal{L}(\Phi)$ for a gain graphs and study its properties in detail, providing insights and counterexamples along the way. We establish bounds for the eigenvalues of…
We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.
We consider the class of simple graphs with large algebraic connectivity (the second-smallest eigenvalue of the Laplacian matrix). For this class of graphs we determine the asymptotic behavior of the number of Eulerian orientations. In…
In this note, we give an infinite family of optimal graphs called $G^+(d,c)$. They are optimal in the sense that they have the maximum possible number of vertices for given a diameter $d$ and the so-called `outer multiset dimension' $c$. We…
In his survey "Beyond graph energy: Norms of graphs and matrices" (2016), Nikiforov proposed two problems concerning characterizing the graphs that attain equality in a lower bound and in a upper bound for the energy of a graph,…
A sequence $D=(d_1,d_2,\ldots,d_n)$ of non-negative integers is called a graphic sequence if there is a simple graph with vertices $v_1,v_2,\ldots,v_n$ such that the degree of $v_i$ is $d_i$ for $1\leq i\leq n$. Given a graph theoretical…
In this draft paper, we introduce a novel architecture for graph networks which is equivariant to the Euclidean group in $n$-dimensions. The model is designed to work with graph networks in their general form and can be shown to include…
We present a novel spectral embedding of graphs that incorporates weights assigned to the nodes, quantifying their relative importance. This spectral embedding is based on the first eigenvectors of some properly normalized version of the…
We extend the notions of the m-splitting graph Sm(G) and the m-shadow graph Dm(G) to introduce two new graph operations: the (p, q)-generalized splitting graph Sp,q(G) and the (c, k)-shadow-splitting graph Hc,k(G). We derive the adjacency…
The characteristic polynomials of the Laplacian and the distance Laplacian matrices of power graphs of groups of order $ pqr $, where $ p,q $ and $ r $ are { primes,} are obtained. Further, the characteristic polynomials of these matrices…
A signless Laplacian eigenvalue of a graph $G$ is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, all connected bicyclic graphs with exactly two main…
We establish metric graph counterparts of Pleijel's theorem on the asymptotics of the number of nodal domains $\nu_n$ of the $n$-th eigenfunction(s) of a broad class of operators on compact metric graphs, including Schr\"odinger operators…
For a finite graph, we establish natural isomorphisms between eigenspaces of a Laplace operator acting on functions on the edges and eigenspaces of a transfer operator acting on functions on one-sided infinite non-backtracking paths.…
The energy of a graph is defined as the sum of the absolute values of the eigenvalues of its adjacency matrix. In this paper, we characterize the tetracyclic graph of order $n$ with minimal energy. By this, the validity of a conjecture for…
The energy of a graph $G$ is the sum of the absolute values of the eigenvalues of the adjacency matrix of $G$. Some variants of energy can also be found in the literature which are defined on the concepts of Laplacian matrix, Distance…
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…
In this note we give a new upper bound for the Laplacian eigenvalues of an unweighted graph. Let $G$ be a simple graph on $n$ vertices. Let $d_{m}(G)$ and $\lambda_{m+1}(G)$ be the $m$-th smallest degree of $G$ and the $m+1$-th smallest…
Spectral analysis of networks states that many structural properties of graphs, such as centrality of their nodes, are given in terms of their adjacency matrices. The natural extension of such spectral analysis to higher order networks is…
In this article we construct a series of new infinite families of strongly regular graphs with the same parameters as the point-graphs of non-singular quadrics in PG(n,2).