Abstract

A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, ordinary star-like selfcontained graphs are introduced and it is shown that every ordinary star-like self-contained graph has infinitely many strong twins or none.

Full Text
Paper version not known

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 call

Disclaimer: 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.