MAXIMUM REVERSE DEGREE ENERGY OF SUBGRAPH COMPLEMENT OF GRAPHS

K. V. Madhumitha; Sabitha D’souza; Swati Nayak

MAXIMUM REVERSE DEGREE ENERGY OF SUBGRAPH COMPLEMENT OF GRAPHS

K. V. Madhumitha
, Sabitha D’souza
, Swati Nayak^*

^*Corresponding author for this work

Manipal Institute of Technology, Manipal

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

Abstract

The subgraph 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 maximum reverse degree energy of connected subgraph complements of a graph. Few properties on maximum reverse degree eigenvalues and bounds for maximum reverse degree energy of connected subgraph complement of a graph are achieved. Further maximum reverse degree energy of connected subgraph complement of some families of graphs are computed.

Original language	English
Pages (from-to)	83-97
Number of pages	15
Journal	Global and Stochastic Analysis
Volume	10
Issue number	2
Publication status	Published - 01-12-2023

All Science Journal Classification (ASJC) codes

Statistics and Probability
Discrete Mathematics and Combinatorics

Cite this

@article{f295222ecb43492fb9d11118b2d3538c,

title = "MAXIMUM REVERSE DEGREE ENERGY OF SUBGRAPH COMPLEMENT OF GRAPHS",

abstract = "The subgraph 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 maximum reverse degree energy of connected subgraph complements of a graph. Few properties on maximum reverse degree eigenvalues and bounds for maximum reverse degree energy of connected subgraph complement of a graph are achieved. Further maximum reverse degree energy of connected subgraph complement of some families of graphs are computed.",

author = "Madhumitha, \{K. V.\} and Sabitha D{\textquoteright}souza and Swati Nayak",

year = "2023",

month = dec,

day = "1",

language = "English",

volume = "10",

pages = "83--97",

journal = "Global and Stochastic Analysis",

issn = "2248-9444",

publisher = "MUK Publications and Distribution",

number = "2",

}

TY - JOUR

T1 - MAXIMUM REVERSE DEGREE ENERGY OF SUBGRAPH COMPLEMENT OF GRAPHS

AU - Madhumitha, K. V.

AU - D’souza, Sabitha

AU - Nayak, Swati

PY - 2023/12/1

Y1 - 2023/12/1

N2 - The subgraph 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 maximum reverse degree energy of connected subgraph complements of a graph. Few properties on maximum reverse degree eigenvalues and bounds for maximum reverse degree energy of connected subgraph complement of a graph are achieved. Further maximum reverse degree energy of connected subgraph complement of some families of graphs are computed.

AB - The subgraph 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 maximum reverse degree energy of connected subgraph complements of a graph. Few properties on maximum reverse degree eigenvalues and bounds for maximum reverse degree energy of connected subgraph complement of a graph are achieved. Further maximum reverse degree energy of connected subgraph complement of some families of graphs are computed.

UR - https://www.scopus.com/pages/publications/85169674672

UR - https://www.scopus.com/pages/publications/85169674672#tab=citedBy

M3 - Article

AN - SCOPUS:85169674672

SN - 2248-9444

VL - 10

SP - 83

EP - 97

JO - Global and Stochastic Analysis

JF - Global and Stochastic Analysis

IS - 2

ER -

MAXIMUM REVERSE DEGREE ENERGY OF SUBGRAPH COMPLEMENT OF GRAPHS

Abstract

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this