The energy of a graph G is equal to the sum of absolute values of the eigenvalues of the adjacency matrix of G, whereas the Laplacian energy of a graph G is equal to the sum of the absolute value of the difference between the eigenvalues of the Laplacian matrix of G and the average degree of the vertices of G. Motivated by the work from Sharafdini an...

A signed graph is a graph where the edges are assigned either positive ornegative signs. Net degree of a signed graph is the dierence between the number ofpositive and negative edges incident with a vertex. It is said to be net-regular if all itsvertices have the same net-degree. Laplacian energy of a signed graph is defined asε(L(Σ)) =|γ_1-(2m)/n|+...+|γ_n-(2m)/n| where γ_1,...,γ_n are the ei...

This paper mainly studies the Laplacian-energy-like invariants of the modified hexagonal lattice, modified Union Jack lattice, and honeycomb lattice. By utilizing the tensor product of matrices and the diagonalization of block circulant matrices, we derive closed-form formulas expressing the Laplacian-energy-like invariants of these lattices. In addition, we obtain explicit asymptotic values of...

‎Let $G$ be a graph without an isolated vertex‎, ‎the normalized Laplacian matrix $tilde{mathcal{L}}(G)$‎ ‎is defined as $tilde{mathcal{L}}(G)=mathcal{D}^{-frac{1}{2}}mathcal{L}(G)mathcal{D}^{-frac{1}{2}}$‎, where ‎$mathcal{D}$ ‎is a‎ diagonal matrix whose entries are degree of ‎vertices ‎‎of ‎$‎G‎$‎‎. ‎The eigenvalues of‎ $tilde{mathcal{L}}(G)$ are ‎called as ‎the ‎normalized Laplacian eigenva...

‎let $g$ be a graph without an isolated vertex‎, ‎the normalized laplacian matrix $tilde{mathcal{l}}(g)$‎‎is defined as $tilde{mathcal{l}}(g)=mathcal{d}^{-frac{1}{2}}mathcal{l}(g) mathcal{d}^{-frac{1}{2}}$‎, where ‎$‎mathcal{‎d}‎$ ‎is a‎ diagonal matrix whose entries are degree of ‎vertices ‎‎of ‎$‎g‎$‎‎. ‎the eigenvalues of‎‎$tilde{mathcal{l}}(g)$ are ‎called ‎ ‎ as ‎the ‎normalized laplacian ...

In this paper, we investigate how the Laplacian coefficients changed after some graph transformations. So, I express some results about Laplacian coefficients ordering of graphs, focusing our attention to the bicyclic graphs. Finally, as an application of these results, we discuss the ordering of graphs based on their Laplacian like energy.

The Laplacian flow is a geometric introduced by Bryant as way for finding torsion free $$G_2$$ -structures starting from closed one. If the invariant under $$S^1$$ action then it descends to of SU(3)-structures on 6-manifold. In this article we derive expressions these evolution equations. our search examples discover first inhomogeneous shrinking solitons, which are also gradient. We show that...

Let f(D(i,j),di,dj) be a real function symmetric in i and j with the property that f(d,(1+o(1))np,(1+o(1))np)=(1+o(1))f(d,np,np) for d=1,2. G graph, di denote degree of vertex D(i,j) distance between vertices G. In this paper, we define f-weighted Laplacian matrix random graphs Erdös-Rényi graph model Gn,p, where p?(0,1) is fixed. Four weighted type energies: energy LEf(G), signless LEf+(G), in...

We introduce the Laplacian sum-eccentricity matrix LS_e} of a graph G, and its Laplacian sum-eccentricity energy LS_eE=sum_{i=1}^n |eta_i|, where eta_i=zeta_i-frac{2m}{n} and where zeta_1,zeta_2,ldots,zeta_n are the eigenvalues of LS_e}. Upper bounds for LS_eE are obtained. A graph is said to be twinenergetic if sum_{i=1}^n |eta_i|=sum_{i=1}^n |zeta_i|. Conditions ...