An improved lower bound for the Seidel energy of trees (Q2166255)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7574731
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved lower bound for the Seidel energy of trees |
scientific article; zbMATH DE number 7574731 |
Statements
An improved lower bound for the Seidel energy of trees (English)
0 references
24 August 2022
0 references
\textit{W. H. Haemers} [MATCH Commun. Math. Comput. Chem. 68, No. 3, 653--659 (2012; Zbl 1289.05290)] conjectured that the Seidel energy of any graph of order \(n\) is at least \(2n-2\). We establish the validity of Haemers' conjecture in general. Later, \textit{S. Akbari} et al. [Eur. J. Comb. 86, Article ID 103078, 8 p. (2020; Zbl 1437.05130] proved this conjecture. In this paper, the authors improve this bound for trees.
0 references
tree graphs
0 references
Seidel energy
0 references
Seidel matrix
0 references
0.8869636654853821
0 references
0.8740726113319397
0 references
0.8516900539398193
0 references
0.8192731738090515
0 references
0.7701977491378784
0 references
