Graphs with large diameter and their two distance forcing number
Journal of Mathematical and Computational Science · 2021
For a given simple graph G = (V,E), the two distance forcing number Z 2d (G) is defined as the minimum cardinality among all Z 2d -sets in G. This paper examine about Z 2d (G) of some graphs with large diameter. Also we determine the 2-distance forcing number of some complement graphs.