Minimum Covering Maximum Reverse Degree Energy Of Graphs

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

In this paper, we have introduced minimum covering maximum reverse degree energy of simple graphs. Few properties on minimum covering maximum reverse degree eigenvalues and bounds for minimum covering maximum reverse degree energy of a graph are achieved. Further minimum covering maximum reverse degree energy of some families of graphs are computed.

Original languageEnglish
Article numberIJCS_50_4_17
JournalIAENG International Journal of Computer Science
Volume50
Issue number4
Publication statusPublished - 2023

All Science Journal Classification (ASJC) codes

  • General Computer Science

Fingerprint

Dive into the research topics of 'Minimum Covering Maximum Reverse Degree Energy Of Graphs'. Together they form a unique fingerprint.

Cite this