Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
