IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4614-4220-2_7.html

Graphs Extremal with Regard to Energy

In: Graph Energy

Author

Listed:
  • Xueliang Li

    (Nankai University, Center for Combinatorics)

  • Yongtang Shi

    (Nankai University, Center for Combinatorics)

  • Ivan Gutman

    (University of Kragujevac, Faculty of Science)

Abstract

One of the fundamental questions that is encountered in the study of graph energy is which graphs (from a given class) have greatest and smallest $$\mathcal{E}$$ -values. The first such result was obtained for trees in[145], where it was demonstrated that the star has minimal and the path maximal energy. In the meantime, a remarkably large number of papers was published on such extremal problems: for general graphs [82, 242, 252, 253, 305, 306, 341, 416, 482], trees and chemical trees[141, 219, 268, 314, 316, 319, 324, 327, 339, 343, 344, 389, 390, 434, 435, 483, 487, 497, 498, 505, 506, 511, 517, 518, 543, 547], unicyclic[51, 58, 185, 191, 266, 270, 273–275, 277, 283, 312, 313, 330, 342, 480, 484–486, 488–490, 514], bicyclic[121, 267, 280, 340, 358, 500, 501, 522, 523], tricyclic [326, 329, 521], and tetracyclic graphs [325], as well as for benzenoid and related polycyclic systems [158, 243, 395, 399, 413–415, 519, 520, 526]. In this chapter we state a few of these results, selecting those that can be formulated in a simple manner or that otherwise deserve to be mentioned. We start with a few elementary results.

Suggested Citation

  • Xueliang Li & Yongtang Shi & Ivan Gutman, 2012. "Graphs Extremal with Regard to Energy," Springer Books, in: Graph Energy, edition 127, chapter 0, pages 99-192, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4614-4220-2_7
    DOI: 10.1007/978-1-4614-4220-2_7
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4614-4220-2_7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.