{"id":{"repo_id":"lethbridge","oai_identifier":"oai:opus.uleth.ca:10133/2489"},"canonical_url":"https://search.ndltd.org/etd/lethbridge/oai:opus.uleth.ca:10133/2489","repository":{"repo_id":"lethbridge","name":"University of Lethbridge","base_url":"https://opus.uleth.ca/server/oai/request"},"display":{"title":"Energy of graphs and digraphs","abstract":"The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. The concept is related to the energy of a class of molecules in chemistry and was first brought to mathematics by Gutman in 1978 ([8]). In this thesis, we do a comprehensive study on the energy of graphs and digraphs. In Chapter 3, we review some existing upper and lower bounds for the energy of a graph. We come up with some new results in this chapter. A graph with n vertices is hyper-energetic if its energy is greater than 2n−2. Some classes of graphs are proved to be hyper-energetic. We find a new class of hyper-energetic graphs which is introduced and proved to be hyper-energetic in Section 3.3. The energy of a digraph is the sum of the absolute values of the real part of the eigenvalues of its adjacency matrix. In Chapter 4, we study the energy of digraphs in a way that Pe˜na and Rada in [19] have defined. Some known upper and lower bounds for the energy of digraphs are reviewed. In Section 4.5, we bring examples of some classes of digraphs in which we find their energy. Keywords. Energy of a graph, hyper-energetic graph, energy of a digraph.","abstract_html":"The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. The concept is related to the energy of a class of molecules in chemistry and was first brought to mathematics by Gutman in 1978 ([8]). In this thesis, we do a comprehensive study on the energy of graphs and digraphs. In Chapter 3, we review some existing upper and lower bounds for the energy of a graph. We come up with some new results in this chapter. A graph with n vertices is hyper-energetic if its energy is greater than 2n−2. Some classes of graphs are proved to be hyper-energetic. We find a new class of hyper-energetic graphs which is introduced and proved to be hyper-energetic in Section 3.3. The energy of a digraph is the sum of the absolute values of the real part of the eigenvalues of its adjacency matrix. In Chapter 4, we study the energy of digraphs in a way that Pe˜na and Rada in [19] have defined. Some known upper and lower bounds for the energy of digraphs are reviewed. In Section 4.5, we bring examples of some classes of digraphs in which we find their energy. Keywords. Energy of a graph, hyper-energetic graph, energy of a digraph.","abstract_has_math":false,"creators":["Jahanbakht, Nafiseh","University of Lethbridge. Faculty of Arts and Science"],"institution":"Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science, c2010","degree_name":null,"degree_level":"Masters","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Kharaghani, Hadi"],"committee_chairs":[],"committee_members":[],"year":2010,"date_issued":"2010","date_published":"2010","updated_at":"2026-11-18T19:32:21Z","subjects":["Graph theory","Directed graphs","Eigenvalues","Dissertations, Academic"],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/10133/2489","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/10133/2489","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://opus.uleth.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aopus.uleth.ca%3A10133%2F2489","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.supervisor","label":"Supervisor","values":["Kharaghani, Hadi"]},{"key":"dc:creator","label":"Author","values":["Jahanbakht, Nafiseh","University of Lethbridge. Faculty of Arts and Science"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2011-07-22T21:46:42Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2011-07-22T21:46:42Z"]},{"key":"dc:date.issued","label":"Date","values":["2010"]},{"key":"dc:publisher","label":"Institution","values":["Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science, c2010"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["Department of Mathematics and Computer Science"]},{"key":"dc:publisher.faculty","label":"Dc Publisher Faculty","values":["Arts and Science"]},{"key":"dc:relation.ispartofseries","label":"Dc Relation Ispartofseries","values":["Thesis (University of Lethbridge. Faculty of Arts and Science)"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Graph theory","Directed graphs","Eigenvalues","Dissertations, Academic"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10133/2489"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["vii, 80 leaves ; 29 cm"]},{"key":"dc:description.abstract","label":"Abstract","values":["The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. The concept is related to the energy of a class of molecules in chemistry and was first brought to mathematics by Gutman in 1978 ([8]). In this thesis, we do a comprehensive study on the energy of graphs and digraphs. In Chapter 3, we review some existing upper and lower bounds for the energy of a graph. We come up with some new results in this chapter. A graph with n vertices is hyper-energetic if its energy is greater than 2n−2. Some classes of graphs are proved to be hyper-energetic. We find a new class of hyper-energetic graphs which is introduced and proved to be hyper-energetic in Section 3.3. The energy of a digraph is the sum of the absolute values of the real part of the eigenvalues of its adjacency matrix. In Chapter 4, we study the energy of digraphs in a way that Pe˜na and Rada in [19] have defined. Some known upper and lower bounds for the energy of digraphs are reviewed. In Section 4.5, we bring examples of some classes of digraphs in which we find their energy. Keywords. Energy of a graph, hyper-energetic graph, energy of a digraph."]},{"key":"dc:title","label":"Title","values":["Energy of graphs and digraphs"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.supervisor":["Kharaghani, Hadi"],"dc:creator":["Jahanbakht, Nafiseh","University of Lethbridge. Faculty of Arts and Science"],"dc:date.accessioned":["2011-07-22T21:46:42Z"],"dc:date.available":["2011-07-22T21:46:42Z"],"dc:date.issued":["2010"],"dc:description":["vii, 80 leaves ; 29 cm"],"dc:description.abstract":["The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. The concept is related to the energy of a class of molecules in chemistry and was first brought to mathematics by Gutman in 1978 ([8]). In this thesis, we do a comprehensive study on the energy of graphs and digraphs. In Chapter 3, we review some existing upper and lower bounds for the energy of a graph. We come up with some new results in this chapter. A graph with n vertices is hyper-energetic if its energy is greater than 2n−2. Some classes of graphs are proved to be hyper-energetic. We find a new class of hyper-energetic graphs which is introduced and proved to be hyper-energetic in Section 3.3. The energy of a digraph is the sum of the absolute values of the real part of the eigenvalues of its adjacency matrix. In Chapter 4, we study the energy of digraphs in a way that Pe˜na and Rada in [19] have defined. Some known upper and lower bounds for the energy of digraphs are reviewed. In Section 4.5, we bring examples of some classes of digraphs in which we find their energy. Keywords. Energy of a graph, hyper-energetic graph, energy of a digraph."],"dc:identifier.uri":["https://hdl.handle.net/10133/2489"],"dc:language.iso":["en_US"],"dc:publisher":["Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science, c2010"],"dc:publisher.department":["Department of Mathematics and Computer Science"],"dc:publisher.faculty":["Arts and Science"],"dc:relation.ispartofseries":["Thesis (University of Lethbridge. Faculty of Arts and Science)"],"dc:subject":["Graph theory","Directed graphs","Eigenvalues","Dissertations, Academic"],"dc:title":["Energy of graphs and digraphs"],"dc:type":["Thesis"],"others:access_status":["open.access"],"thesis:degree_level":["Masters"]},"updated_at":"2026-11-18T19:32:21Z"}