Eccentricity splitting graph of a graph

Title

Eccentricity splitting graph of a graph

Creator

Baskar N.; Mangam T.A.; Acharya M.

Description

Let G = (V, E) be any connected graph with (Figure presented.) for all uj, uk ? Si if e(uj) = e(uk)(1 ? i ? t) with each | Si |? 2 and (Figure presented.). The eccentricity splitting graph of a graph denoted by ES(G) is obtained by taking a copy of G and adding vertices w 1, w 2, , wt such that wi is adjacent only to the vertices of Si for 1 ? i ? t. We initiate the study on eccentricity splitting graph ES(G) and examine its structural properties. We also analyze diameter, girth and chromatic number of eccentricity splitting graphs of certain classes of graphs. 2021 Taru Publications.

Source

Journal of Discrete Mathematical Sciences and Cryptography, Vol-24, No. 1, pp. 183-194.

Date

2021-01-01

Publisher

Taylor and Francis Ltd.

Subject

05C12; 05C15; Chromatic number; Diameter; Eccentricity splitting graph; Girth

Coverage

Baskar N., Department of Mathematics, Christ University (Deemed to be University), Bengaluru, 560029, Karnataka, India; Mangam T.A., Department of Mathematics, Christ University (Deemed to be University), Bengaluru, 560029, Karnataka, India; Acharya M., Department of Mathematics, Christ University (Deemed to be University), Bengaluru, 560029, Karnataka, India

Rights

Restricted Access

Relation

ISSN: 9720529

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.1080/09720529.2020.1809109

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85098893039&doi=10.1080%2f09720529.2020.1809109&partnerID=40&md5=1dbb956dfe7df97b8789e36d9bf3c84c