The minimum absolute deviation covering distance energy of graphs

Energies of graphs found a number of various remarkable applications in chemistry for finding H¨uckel molecular orbital total π-electron energy. For any simple graph with its minimum covering distance matrix and its corresponding Eigan values the minimum absolute deviation covering distance energy of ܩ is defined and derived the results on Minimum absolute deviation covering distance energy of few standard graphs and then their bounds also established.