Let G be a graph on n vertices, and let CHP(G; ฮป) be the characteristic polynomial of its adjacency matrix A(G). All n roots of CHP(G; ฮป), denoted by ฮป i (i = 1, 2, . . . n), are called to be its eigenvalues. The energy E(G) of a graph G, is the sum of absolute values of all eigenvalues, namely, E(G
โฆ LIBER โฆ
Minimal energy on a class of graphs
โ Scribed by Maolin Wang; Hongbo Hua; Dongdong Wang
- Publisher
- Springer
- Year
- 2007
- Tongue
- English
- Weight
- 205 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0259-9791
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Minimality considerations for graph ener
โ
Dongdong Wang; Hongbo Hua
๐
Article
๐
2008
๐
Elsevier Science
๐
English
โ 649 KB
On bicyclic graphs with minimal energies
โ
Jianbin Zhang; Bo Zhou
๐
Article
๐
2005
๐
Springer
๐
English
โ 100 KB
On tricyclic graphs of a given diameter
โ
Shuchao Li; Xuechao Li
๐
Article
๐
2009
๐
Elsevier Science
๐
English
โ 234 KB
Minimizer graphs for a class of extremal
โ
Dan Ismailescu; Dan Stefanica
๐
Article
๐
2002
๐
John Wiley and Sons
๐
English
โ 93 KB
๐ 2 views
## Abstract We consider the family of graphs with a fixed number of vertices and edges. Among all these graphs, we are looking for those minimizing the sum of the square roots of the vertex degrees. We prove that there is a unique such graph, which consists of the largest possible complete subgraph
Minimal energy of unicyclic graphs of a
โ
Feng Li; Bo Zhou
๐
Article
๐
2006
๐
Springer
๐
English
โ 150 KB
A note on minimal visibility graphs
โ
Xiaojun Shen; Qing Hu
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 60 KB