Graphs with large diameter and their two distance forcing number
Abstract
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.
Copyright © 2021 K.P. Premodkumar, Charles Dominic, Baby Chacko. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
K. P. Premodkumar, C. Dominic, B. Chacko, Graphs with large diameter and their two distance forcing number, J. Math. Comput. Sci. 11 (2021), 1810–1837. https://doi.org/10.28919/jmcs/5366
BibTeX
@article{Premodkumar2021,
author = {Premodkumar, K.P. and Dominic, Charles and Chacko, Baby},
title = {Graphs with large diameter and their two distance forcing number},
journal = {J. Math. Comput. Sci.},
volume = {11},
year = {2021},
pages = {1810--1837},
doi = {10.28919/jmcs/5366}
}