Minimum covering reciprocal distance signless Laplacian energy of graphs
Let G be a simple connected graph. The reciprocal transmission Tr′G(ν) of a vertex ν is defined as
Main Authors: | Alhevaz Abdollah, Baghipur Maryam, Hashemi Ebrahim, Alizadeh Yaser |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2018-12-01
|
Series: | Acta Universitatis Sapientiae: Informatica |
Subjects: | |
Online Access: | https://doi.org/10.2478/ausi-2018-0011 |
Similar Items
-
On Distance Signless Laplacian Spectral Radius and Distance Signless Laplacian Energy
by: Luis Medina, et al.
Published: (2020-05-01) -
On distance signless Laplacian spectrum and energy of graphs
by: Abdollah Alhevaz, et al.
Published: (2018-10-01) -
On the Second-Largest Reciprocal Distance Signless Laplacian Eigenvalue
by: Maryam Baghipur, et al.
Published: (2021-03-01) -
Merging the Spectral Theories of Distance Estrada and Distance Signless Laplacian Estrada Indices of Graphs
by: Abdollah Alhevaz, et al.
Published: (2019-10-01) -
Color signless Laplacian energy of graphs
by: Pradeep G. Bhat, et al.
Published: (2017-08-01)