๐”– Bobbio Scriptorium
โœฆ   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

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

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

A note on minimal visibility graphs
โœ Xiaojun Shen; Qing Hu ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 60 KB