Graphs with large diameter and their two distance forcing number

Title

Graphs with large diameter and their two distance forcing number

Creator

Premodkumar K.P.; Dominic C.; Chacko B.

Description

For a given simple graph G = (V,E), the two distance forcing number Z2d (G) is defined as the minimum cardinality among all Z2d-sets in G. This paper examine about Z2d (G) of some graphs with large diameter. Also we determine the 2-distance forcing number of some complement graphs. 2021 the author(s).

Source

Journal of Mathematical and Computational Science, Vol-11, No. 2, pp. 1810-1837.

Date

2021-01-01

Publisher

SCIK Publishing Corporation

Subject

2-distance forcing number; 2-distance forcing set; diameter

Coverage

Premodkumar K.P., Department and Research Center of Mathematics, St. Josephs College, Devagiri, Calicut, Kerala, India; Dominic C., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, India; Chacko B., Department and Research Center of Mathematics, St. Josephs College, Devagiri, Calicut, Kerala, India

Rights

All Open Access; Gold Open Access

Relation

ISSN: 19275307

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.28919/jmcs/5366

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85103372662&doi=10.28919%2fjmcs%2f5366&partnerID=40&md5=14a13a1fa4dfdc6864ee049e460aa928