Skip to content
2000
Volume 25, Issue 3
  • ISSN: 1386-2073
  • E-ISSN: 1875-5402

Abstract

Background: The energy E(G)of Graph G is defined as the sum of the absolute values of the eigenvalues of its adjacency matrix. In theoretical chemistry, within the Huckel molecular orbital (HMO) approximation, the energy levels of the π-electrons in molecules of conjugated hydrocarbons are related to the energy of the molecular graphs. Objective: The digraph with maximum digraph energy in a class of graphs is found. Methodology: Let Δ be the set consisting of digraphs with n vertices and each cycle having length = 2mod(4). The set of all the n-order directed hollow k-polygons in Δ based on a - polygon G is denoted by H(G). Results: In this research, by using the quasi-order relation over Δ and the characteristic polynomials of digraphs, we describe the directed hollow k-polygon with the maximum digraph energy in H(G). Conclusion: The n-order oriented hollow k-polygon with the maximum digraph energy among H_k (G) only contains a cycle. Moreover, such a cycle is the longest one produced in G.

Loading

Article metrics loading...

/content/journals/cchts/10.2174/1386207323666201111125732
2022-03-01
2025-07-05
Loading full text...

Full text loading...

/content/journals/cchts/10.2174/1386207323666201111125732
Loading

  • Article Type:
    Research Article
Keyword(s): diagonal matrix; Energy (of a graph); digraphs; adjacency matrix; HMO; quasi-order
This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error
Please enter a valid_number test