scholarly journals On the Laplacian eigenvalues of a graph and Laplacian energy

2015 ◽  
Vol 486 ◽  
pp. 454-468 ◽  
Author(s):  
S. Pirzada ◽  
Hilal A. Ganie
Keyword(s):  
Laplacian Eigenvalues ◽  
Laplacian Energy

scholarly journals The Laplacian Energy of Conjugacy Class Graph of Some Finite Groups

MATEMATIKA ◽  
2019 ◽  
Vol 35 (1) ◽  
pp. 59-65
Author(s):  
Rabiha Mahmoud ◽  
Amira Fadina Ahmad Fadzil ◽  
Nor Haniza Sarmin ◽  
Ahmad Erfanian
Keyword(s):  
Conjugacy Class ◽  
Finite Groups ◽  
Dihedral Group ◽  
Dihedral Groups ◽  
Laplacian Eigenvalues ◽  
Laplacian Matrices ◽  
Laplacian Energy ◽  
The Difference ◽  
Generalized Quaternion ◽  
Class Graph

Let G be a dihedral group and its conjugacy class graph. The Laplacian energy of the graph, is defined as the sum of the absolute values of the difference between the Laplacian eigenvalues and the ratio of twice the edges number divided by the vertices number. In this research, the Laplacian matrices of the conjugacy class graph of some dihedral groups, generalized quaternion groups, quasidihedral groups and their eigenvalues are first computed. Then, the Laplacian energy of the graphs are determined.

scholarly journals On relations between Kirchhoff index, Laplacian energy, Laplacian-energy-like invariant and degree deviation of graphs

Filomat ◽  
2020 ◽  
Vol 34 (3) ◽  
pp. 1025-1033
Author(s):  
Predrag Milosevic ◽  
Emina Milovanovic ◽  
Marjan Matejic ◽  
Igor Milovanovic
Keyword(s):  
Topological Index ◽  
Degree Sequence ◽  
Laplacian Matrix ◽  
Vertex Degree ◽  
Graph Invariants ◽  
Kirchhoff Index ◽  
Laplacian Eigenvalues ◽  
Laplacian Energy ◽  
Degree Deviation ◽  
Simple Connected Graph

Let G be a simple connected graph of order n and size m, vertex degree sequence d1 ? d2 ?...? dn > 0, and let ?1 ? ? 2 ? ... ? ?n-1 > ?n = 0 be the eigenvalues of its Laplacian matrix. Laplacian energy LE, Laplacian-energy-like invariant LEL and Kirchhoff index Kf, are graph invariants defined in terms of Laplacian eigenvalues. These are, respectively, defined as LE(G) = ?n,i=1 |?i-2m/n|, LEL(G) = ?n-1 i=1 ??i and Kf (G) = n ?n-1,i=1 1/?i. A vertex-degree-based topological index referred to as degree deviation is defined as S(G) = ?n,i=1 |di- 2m/n|. Relations between Kf and LE, Kf and LEL, as well as Kf and S are obtained.

On skew Laplacian spectrum and energy of digraphs

2020 ◽  
pp. 2150051 ◽  
Author(s):  
Hilal A. Ganie ◽  
S. Pirzada ◽  
Bilal A. Chat ◽  
X. Li
Keyword(s):  
Laplacian Matrix ◽  
Laplacian Spectrum ◽  
Arbitrary Direction ◽  
Laplacian Eigenvalues ◽  
Underlying Graph ◽  
Laplacian Energy ◽  
Energy Formula

We consider the skew Laplacian matrix of a digraph [Formula: see text] obtained by giving an arbitrary direction to the edges of a graph [Formula: see text] having [Formula: see text] vertices and [Formula: see text] edges. With [Formula: see text] to be the skew Laplacian eigenvalues of [Formula: see text], the skew Laplacian energy [Formula: see text] of [Formula: see text] is defined as [Formula: see text]. In this paper, we analyze the effect of changing the orientation of an induced subdigraph on the skew Laplacian spectrum. We obtain bounds for the skew Laplacian energy [Formula: see text] in terms of various parameters associated with the digraph [Formula: see text] and the underlying graph [Formula: see text] and we characterize the extremal digraphs attaining these bounds. We also show these bounds improve some known bounds for some families of digraphs. Further, we show the existence of some families of skew Laplacian equienergetic digraphs.

On distance Laplacian spectrum (energy) of graphs

2020 ◽  
Vol 12 (05) ◽  
pp. 2050061 ◽  
Author(s):  
Hilal A. Ganie
Keyword(s):  
Chromatic Number ◽  
Wiener Index ◽  
Laplacian Spectrum ◽  
Connected Graphs ◽  
Laplacian Eigenvalues ◽  
Laplacian Energy ◽  
Number Formula ◽  
Energy Formula ◽  
Average Transmission ◽  
Simple Connected Graph

For a simple connected graph [Formula: see text] of order [Formula: see text] having distance Laplacian eigenvalues [Formula: see text], the distance Laplacian energy [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the Wiener index of [Formula: see text]. We obtain the distance Laplacian spectrum of the joined union of graphs [Formula: see text] in terms of their distance Laplacian spectrum and the spectrum of an auxiliary matrix. As application, we obtain the distance Laplacian spectrum of the lexicographic product of graphs. We study the distance Laplacian energy of connected graphs with given chromatic number [Formula: see text]. We show that among all connected graphs with chromatic number [Formula: see text] the complete [Formula: see text]-partite graph has the minimum distance Laplacian energy. Further, we discuss the distribution of distance Laplacian eigenvalues around average transmission degree [Formula: see text].

scholarly journals Energy and Laplacian energy of unitary addition Cayley graphs

Filomat ◽  
2019 ◽  
Vol 33 (11) ◽  
pp. 3599-3613
Author(s):  
Naveen Palanivel ◽  
A.V. Chithra
Keyword(s):  
Prime Number ◽  
Cayley Graph ◽  
Cayley Graphs ◽  
Laplacian Eigenvalues ◽  
Laplacian Energy ◽  
Prime Factors

In this paper, we obtain the eigenvalues and Laplacian eigenvalues of the unitary addition Cayley graph Gn and its complement. Moreover, we compute the bounds for energy and Laplacian energy for Gn and its complement. In addition, we prove that Gn is hyperenergetic if and only if n is odd other than the prime number and power of 3 or n is even and has at least three distinct prime factors. It is also shown that the complement of Gn is hyperenergetic if and only if n has at least two distinct prime factors and n ? 2p.

scholarly journals On Laplacian Equienergetic Signed Graphs

2021 ◽  
Vol 2021 ◽  
pp. 1-7
Author(s):  
Qingyun Tao ◽  
Lixin Tao
Keyword(s):  
Average Degree ◽  
Signed Graph ◽  
Signed Graphs ◽  
Laplacian Eigenvalues ◽  
Laplacian Energy

The Laplacian energy of a signed graph is defined as the sum of the distance of its Laplacian eigenvalues from its average degree. Two signed graphs of the same order are said to be Laplacian equienergetic if their Laplacian energies are equal. In this paper, we present several infinite families of Laplacian equienergetic signed graphs.

On the sum of the distance signless Laplacian eigenvalues of a graph and some inequalities involving them

2019 ◽  
Vol 12 (01) ◽  
pp. 2050006 ◽  
Author(s):  
A. Alhevaz ◽  
M. Baghipur ◽  
E. Hashemi ◽  
S. Paul
Keyword(s):  
Lower Bounds ◽  
Connected Graph ◽  
Distance Matrix ◽  
Laplacian Matrix ◽  
Simple Graph ◽  
Graph Invariants ◽  
Laplacian Eigenvalues ◽  
Laplacian Energy ◽  
Signless Laplacian ◽  
Eigenvalues Of Graphs

The distance signless Laplacian matrix of a connected graph [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the distance matrix of [Formula: see text] and [Formula: see text] is the diagonal matrix of vertex transmissions of [Formula: see text]. If [Formula: see text] are the distance signless Laplacian eigenvalues of a simple graph [Formula: see text] of order [Formula: see text] then we put forward the graph invariants [Formula: see text] and [Formula: see text] for the sum of [Formula: see text]-largest and the sum of [Formula: see text]-smallest distance signless Laplacian eigenvalues of a graph [Formula: see text], respectively. We obtain lower bounds for the invariants [Formula: see text] and [Formula: see text]. Then, we present some inequalities between the vertex transmissions, distance eigenvalues, distance Laplacian eigenvalues, and distance signless Laplacian eigenvalues of graphs. Finally, we give some new results and bounds for the distance signless Laplacian energy of graphs.

Extremal graph on normalized Laplacian spectral radius and energy

2015 ◽  
Vol 29 ◽  
pp. 237-253 ◽  
Author(s):  
Kinkar Das ◽  
SHAOWEI SUN
Keyword(s):  
Lower Bound ◽  
Spectral Radius ◽  
Complete Graph ◽  
Connected Graph ◽  
Simple Graph ◽  
Extremal Graphs ◽  
Laplacian Spectral Radius ◽  
Laplacian Eigenvalues ◽  
Laplacian Energy ◽  
Isolated Vertex

Let $G=(V,\,E)$ be a simple graph of order $n$ and the normalized Laplacian eigenvalues $\rho_1\geq \rho_2\geq \cdots\geq\rho_{n-1}\geq \rho_n=0$. The normalized Laplacian energy (or Randi\'c energy) of $G$ without any isolated vertex is defined as $$RE(G)=\sum_{i=1}^{n}|\rho_i-1|.$$ In this paper, a lower bound on $\rho_1$ of connected graph $G$ ($G$ is not isomorphic to complete graph) is given and the extremal graphs (that is, the second minimal normalized Laplacian spectral radius of connected graphs) are characterized. Moreover, Nordhaus-Gaddum type results for $\rho_1$ are obtained. Recently, Gutman et al.~gave a conjecture on Randi\'c energy of connected graph [I. Gutman, B. Furtula, \c{S}. B. Bozkurt, On Randi\'c energy, Linear Algebra Appl. 442 (2014) 50--57]. Here this conjecture for starlike trees is proven.

scholarly journals On graphs with minimal distance signless Laplacian energy

2021 ◽  
Vol 13 (2) ◽  
pp. 450-467
Author(s):  
S. Pirzada ◽  
Bilal A. Rather ◽  
Rezwan Ul Shaban ◽  
Merajuddin
Keyword(s):  
Minimum Distance ◽  
Independence Number ◽  
Minimal Distance ◽  
Vertex Connectivity ◽  
Split Graph ◽  
Connected Graphs ◽  
Laplacian Eigenvalues ◽  
Laplacian Energy ◽  
Signless Laplacian ◽  
Simple Connected Graph

Abstract For a simple connected graph G of order n having distance signless Laplacian eigenvalues ρ 1 Q ≥ ρ 2 Q ≥ ⋯ ≥ ρ n Q \rho _1^Q \ge \rho _2^Q \ge \cdots \ge \rho _n^Q , the distance signless Laplacian energy DSLE(G) is defined as D S L E ( G ) = ∑ i = 1 n | ρ i Q - 2 W ( G ) n | DSLE\left( G \right) = \sum\nolimits_{i = 1}^n {\left| {\rho _i^Q - {{2W\left( G \right)} \over n}} \right|} where W(G) is the Weiner index of G. We show that the complete split graph has the minimum distance signless Laplacian energy among all connected graphs with given independence number. Further, we prove that the graph Kk ∨ ( Kt∪ Kn−k−t), 1 ≤ t ≤ ⌊ n - k 2 ⌋ 1 \le t \le \left\lfloor {{{n - k} \over 2}} \right\rfloor has the minimum distance signless Laplacian energy among all connected graphs with vertex connectivity k.

Sign in / Sign up

Export Citation Format

Share Document