Distance energy of partial complementary graph

Document Type

Article

Publication Title

Journal of Mathematical and Computational Science

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.

First Page

1590

Last Page

1606

DOI

10.28919/jmcs/4581

Publication Date

1-1-2020

This document is currently not available here.

Share

COinS