Strong Twins of Ordinary Star-Like Self-Contained Graphs

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.

Saved in:
Bibliographic Details
Published in:arXiv.org 2015-03
Main Authors: Mohammad Hadi Shekarriz, Mirzavaziri, Madjid
Format: Article
Language:English
Subjects:
Graph theory
Graphs
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2331-8422