Results 41 to 50 of about 6,081 (145)

On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs

open access: yesDiscrete Applied Mathematics, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
K. Das, M. Aouchiche, P. Hansen
semanticscholar   +3 more sources

Generalized Characteristic Polynomials of Join Graphs and Their Applications

open access: yesDiscrete Dynamics in Nature and Society, 2017
The Kirchhoff index of G is the sum of resistance distances between all pairs of vertices of G in electrical networks. LEL(G) is the Laplacian-Energy-Like Invariant of G in chemistry.
Pengli Lu, Ke Gao, Yang Yang
doaj   +2 more sources

On comparison between the distance energies of a connected graph [PDF]

open access: yesHeliyon
Let G be a simple connected graph of order n having Wiener index W(G). The distance, distance Laplacian and the distance signless Laplacian energies of G are respectively defined asDE(G)=∑i=1n|υiD|,DLE(G)=∑i=1n|υiL−Tr‾|andDSLE(G)=∑i=1n|υiQ−Tr‾|, where ...
Hilal A. Ganie   +2 more
doaj   +2 more sources

Bounds for the signless Laplacian energy of digraphs

open access: yesIndian Journal of Pure and Applied Mathematics, 2017
The paper under review gives upper and lower bounds for the signless Laplacian energy of finite directed graphs without loops and multiple arcs but perhaps with a pair of oppositely directed arcs joining the same pair of vertices. The signless Laplacian is defined to be \(Q=D+A,\) where \(D\) is the diagonal matrix with outdegrees of vertices along the
Weige Xi, Ligong Wang
semanticscholar   +4 more sources

The signless Laplacian coefficients and the incidence energy of graphs with a given bipartition

open access: diamondFilomat, 2020
We consider two classes of the graphs with a given bipartition. One is trees and the other is unicyclic graphs. The signless Laplacian coefficients and the incidence energy are investigated for the sets of trees/unicyclic graphs with n vertices in which each tree/unicyclic graph has an (n1,n2)-bipartition, where n1 and n2 are positive integers
Lei Zhong, Wen-Huan Wang
openalex   +4 more sources

New upper bounds for the energy and signless Laplacian energy of a graph [PDF]

open access: greenInternational Journal of Advances in Applied Mathematics and Mechanics, 2015
Rao Li
doaj   +2 more sources

Common neighborhood Laplacian and signless Laplacian spectra and energies of commuting graphs [PDF]

open access: green
In this paper, we compute common neighbourhood Laplacian spectrum, common neighbourhood signless Laplacian spectrum and their respective energies of commuting graph of some finite non-abelian groups including some AC-groups, groups whose central quotients are isomorphic to $Sz(2)$, $\mathbb{Z}_p\times \mathbb{Z}_p$ or $D_{2m}$.
Firdous Ee Jannat, Rajat Kanti Nath
openalex   +3 more sources

On the bounds for signless Laplacian energy of a graph

open access: yesDiscrete Applied Mathematics, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hilal A. Ganie, S. Pirzada
semanticscholar   +3 more sources

Signless Laplacian energies of non-commuting graphs of finite groups and related results [PDF]

open access: greenDiscrete Mathematics, Algorithms and Applications, 2023
The non-commuting graph of a non-abelian group [Formula: see text] with center [Formula: see text] is a simple undirected graph whose vertex set is [Formula: see text] and two vertices [Formula: see text] are adjacent if [Formula: see text]. In this paper, we compute Signless Laplacian spectrum and Signless Laplacian energy of non-commuting graphs of ...
Monalisha Sharma, Rajat Kanti Nath
openalex   +3 more sources

Home - About - Disclaimer - Privacy