Orderenergetic, hypoenergetic and equienergetic graphs resulting from some graph operations

Jahfar TK; Chithra AV

Orderenergetic, hypoenergetic and equienergetic graphs resulting from some graph operations

Combinatorics 2021-05-04 v2

Authors: Jahfar TK , Chithra AV

Abstract

A graph G is said to be orderenergetic, if its energy equal to its order and it is said to be hypoenergetic if its energy less than its order. Two non-isomorphic graphs of same order are said to be equienergetic if their energies are equal. In this paper, we construct some new families of orderenergetic graphs, hypoenergetic graphs, equienergetic graphs, equiorderenergetic graphs and equihypoenergetic graphs.

Keywords

graph energy graph theory

Cite

@article{arxiv.2104.12082,
  title  = {Orderenergetic, hypoenergetic and equienergetic graphs resulting from some graph operations},
  author = {Jahfar TK and Chithra AV},
  journal= {arXiv preprint arXiv:2104.12082},
  year   = {2021}
}