Distance energy of partial complementary graph

Swati Nayak, Sabitha D’souza, H. J. Gowtham, Pradeep G. Bhat

Research output: Contribution to journalArticle

Abstract

The partial complement of a graph G with respect to a set S is the graph obtained from G by removing the edges of induced subgraph 〈S〉 and adding edges which are not in 〈S〉 of G. In this paper we introduce the concept of distance energy of connected partial complements of a graph. Few properties on distance eigenvalues and bounds for distance energy of connected partial complement of a graph are achieved. Further distance energy of connected partial complement of some families of graphs are computed.

Original languageEnglish
Pages (from-to)1590-1606
Number of pages17
JournalJournal of Mathematical and Computational Science
Volume10
Issue number5
DOIs
Publication statusPublished - 2020

All Science Journal Classification (ASJC) codes

  • Mathematics(all)
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Distance energy of partial complementary graph'. Together they form a unique fingerprint.

  • Cite this