\((-2)\)-monohemimorphic graphs

DOI10.1016/J.CRMA.2012.09.009zbMath1253.05106OpenAlexW2018327954MaRDI QIDQ715627

Badr Boushabi, Abderrahim Boussaïri

Publication date: 31 October 2012

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.crma.2012.09.009

zbMATH Keywords

self-complementary graphsedge-transitive graphshemimorphic graphs

Mathematics Subject Classification ID

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

Related Items (1)

Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)

Cites Work

• Unnamed Item
• Unnamed Item
• Theory of relations. Transl. from the French by P. Clote
• Sur certains tournois reconstructibles application à leurs groupes d'automorphismes
• Automorphism groups of designs
• On Sets of Acquaintances and Strangers at any Party
• Reconstructible and Half-Reconstructible Tournaments: Application to Their Groups of Hemimorphisms
• An algebraic characterization of finite symmetric tournaments
• All self-complementary symmetric graphs

This page was built for publication: \((-2)\)-monohemimorphic graphs