Results 71 to 80 of about 222 (137)

On distance Laplacian energy in terms of graph invariants

open access: yes, 2023
summary:For a simple connected graph $G$ of order $n$ having distance Laplacian eigenvalues $ \rho ^{L}_{1}\geq \rho ^{L}_{2}\geq \cdots \geq \rho ^{L}_{n}$, the distance Laplacian energy ${\rm DLE} (G)$ is defined as ${\rm DLE} (G)=\sum _{i=1}^{n}|\rho ^
Rather, Bilal A.   +3 more
core   +1 more source

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

open access: yesFilomat, 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
Zhong, Lei, Wang, Wen-Huan
openaire   +3 more sources

Some results on signless Laplacian coefficients of graphs

open access: yes, 2012
Let QG(x)=det(xI-Q(G))=∑i=0n(-1)iζixn-i be the characteristic polynomial of the signless Laplacian matrix of a graph G. Due to the nice properties of the signless Laplacian matrix, Q(G), in comparison with the other matrices related to graphs, ζ-ordering,
Mirzakhah, Maryam, Kiani, Dariush
core   +1 more source

Signless Laplacian Energy of Operations on Intuitionistic Fuzzy Graphs

open access: yesInternational Journal of Engineering & Technology, 2018
After determining the  Signless Laplacian energy of an Intuitionistic fuzzy graphs and the study of lower and upper boundaries of Signless Laplacian energy of an Intuitionistic fuzzy graphs, then we planned to search Signless Laplacian energy of an Intuitionistic fuzzy graphs on some operations such as Union and Join of the Intuitionistic Fuzzy Graphs ...
Obbu Ramesh   +2 more
openaire   +2 more sources

Minimum dominating signless laplacian graph energy

open access: yesJournal of Physics: Conference Series, 2020
Abstract Minimum dominating graph energy was proposed by Rajesh Kanna et al.[11] in 2013. I propose the Minumum dominating signless laplacian graph energy L D
openaire   +1 more source

Signless Laplacian Energy in Products of Intuitionistic Fuzzy Graphs

open access: yesInternational Journal of Recent Technology and Engineering (IJRTE), 2019
The observation of an Intuitionistic Fuzzy Graph’s signless laplacian energy is expanded innumerous products in Intuitionistic Fuzzy Graph. During this paper, we have got the value of signless laplacian Energy in unrelated products such as Cartesian product, Lexicographic Product, Tensor product and Strong Product, product, product and product amongst ...
Obbu Ramesh, Dr. Sharief Basha.S
openaire   +1 more source

The signless Laplacian coefficients and incidence energy of bicyclic graphs

open access: yesLinear Algebra and its Applications, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jie Zhang, Xiao-Dong Zhang
openaire   +1 more source

Some Results for the (Signless) Laplacian Resolvent [PDF]

open access: yes, 2017
Fil: Grippo, Luciano Norberto. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina.Fil: Grippo, Luciano Norberto. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina.Fil: Cafure, Antonio Artemio.
Cafure, Antonio Artemio   +6 more
core   +2 more sources

On spectrum and energies of enhanced power graphs

open access: yesMathematics Open
The enhanced power graph [Formula: see text] of a group G is a simple graph with vertex set G and two distinct vertex are adjacent if and only if they belong to the same cyclic subgroup.
Pankaj Kalita, Prohelika Das
doaj   +1 more source

Further results on the distance signless Laplacian spectrum of graphs

open access: yes, 2018
The distance signless Laplacian matrix [Formula: see text] 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
Abdollah Alhevaz   +2 more
core   +1 more source

Home - About - Disclaimer - Privacy