Common Proof Methods

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 4 in Graph Energy, 2012, pp 25-57 from Springer

Abstract: Abstract After the concept of graph energy was proposed [149], there was much research on this topic. One basic problem is to find the extremal values or the best bounds for the energy within some special classes of graphs and graphs from these classes with extremal values of energy. Finding answers to such questions is often far from elementary. In this chapter we outline some fundamental methods that are frequently used for solving problems of this kind.

Keywords: Energy Graph; Pendant Vertex; Coulson Integral Formula; Secondary Energy Minimum; Pendent Paths (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_4

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

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

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 ().