Strong Twins of Ordinary Star-Like Self-Contained Graphs

MaRDI QIDQ4978187zbMATH OpenFDO

Authors Mohammad Hadi Shekarriz, Madjid Mirzavaziri

Publication date 17 August 2017

Full work available at URL https://arxiv.org/abs/1503.00179

zbMATH Keywords

graph alternative conjectureordinary star-like self-contained graphself-contained graph

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Infinite graphs (05C63)

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.

Recommendations

• Strongly self-dual graphs
• Regular star complements in strongly regular graphs
• scientific article; zbMATH DE number 2044945
• On strong Menger-connectivity of star graphs
• scientific article; zbMATH DE number 6181702
• Strong \(f\)-star factors of graphs
• Star complementary strongly regular decompositions of strongly regular graphs
• Strong Cospectrality and Twin Vertices in Weighted Graphs
• On double-star decomposition of graphs
• On decomposing regular graphs into isomorphic double-stars

Cited in

(3)

• On a property of graphs containing infinitely many isomorphic copies of themselves
• On Ramsey-minimal infinite graphs
• Infinite Ramsey-minimal graphs for star forests

This page was built for publication: Strong Twins of Ordinary Star-Like Self-Contained Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4978187)