MINIMUM HUB DEGREE ADJACENCY ENERGY OF A GRAPH

Abstract

A subset  of the vertex set of a graph   is called a hub set if, for every pair of vertices , there exists a  path whose intermediate vertices all belong to  Any hub set with minimum cardinality is called a minimum hub set, and its cardinality is known as minimum hub number. In this paper we intoduced a new graph energy called the minimum hub degree adjacency energy  of a graph  and evaluated this energy for several well-known classes of graphs.