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 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
