On generalized distance energy of graphs (Q2197121)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On generalized distance energy of graphs |
scientific article; zbMATH DE number 7241715
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On generalized distance energy of graphs |
scientific article; zbMATH DE number 7241715 |
Statements
On generalized distance energy of graphs (English)
0 references
28 August 2020
0 references
The authors considered the generalized distance energy of graphs in this paper. Some interesting bounds are obtained. Moreover, the extremal graphs are also determined in the sets of bipartite graphs and trees. The techniques they used are standard, and the expression is very clear.
0 references
distance matrix
0 references
energy
0 references
distance Laplacian matrix
0 references
signless Laplacian matrix
0 references
generalized distance matrix
0 references
transmission regular graph
0 references
0 references
0 references
0.8588665723800659
0 references
0.8332654237747192
0 references
0.8215232491493225
0 references
0.819556474685669
0 references
0.8090872764587402
0 references
