A unicyclic graph is a connected graph of order with edges which can be obtained by adding a new edge into a tree. For a simple graph G with vertices and edges, extended energy is defined as ( ) Σ | | where are the eigen values of extended adjacency matrix. This paper introduces some new sharp upper bounds for extended energy of special class of unicyclic graphs
Volume 12 | Issue 4
Pages: 460-467
DOI: 10.5373/JARDCS/V12I4/20201677