Hypoenergetic and Strongly Hypoenergetic Graphs

Xueliang Li, Yongtang Shi and Ivan Gutman
Additional contact information
Xueliang Li: Nankai University, Center for Combinatorics
Yongtang Shi: Nankai University, Center for Combinatorics
Ivan Gutman: University of Kragujevac, Faculty of Science

Chapter Chapter 9 in Graph Energy, 2012, pp 203-230 from Springer

Abstract: Abstract A graph on n vertices, whose energy is less than n, i.e., ℰ(G)

Keywords: Tricyclic Graphs; Bicyclic Graphs; Extremal Graph; Combine Lemmas; Maximum Vertex Degree (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-4220-2_9

Ordering information: This item can be ordered from
http://www.springer.com/9781461442202

DOI: 10.1007/978-1-4614-4220-2_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().