Strong Twins of Ordinary Star-Like Self-Contained Graphs
Combinatorics
2015-03-11 v3
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 self-contained graphs are introduced and it is shown that every ordinary star-like self-contained graph has infinitely many strong twins or none.
Cite
@article{arxiv.1503.00179,
title = {Strong Twins of Ordinary Star-Like Self-Contained Graphs},
author = {Mohammad Hadi Shekarriz and Madjid Mirzavaziri},
journal= {arXiv preprint arXiv:1503.00179},
year = {2015}
}