The -k-self-duality of finite lexicographic sums of tournaments under a 3-cycle or a critical tournament

MaRDI QIDQ5310207zbMATH OpenFDO

Authors Houcine Bouchaala, Youssef Boudabbous

Publication date 21 September 2007

zbMATH Keywords

isomorphie et autodualitésommes lexicographiquestournoistournois critiques

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• The \(\{-3\}\)-reconstruction and the \(\{-3\}\)-self duality of tournaments.
• The \(\{-2,-1\}\)-selfdual and decomposable tournaments
• scientific article; zbMATH DE number 6930600
• Half-isomorphy, selfduality and finite non strongly connected tournaments
• scientific article; zbMATH DE number 817353

Cited in

(5)

• The \(\{-2,-1\}\)-selfdual and decomposable tournaments
• Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments
• \(\{-1\}\)-self dual finite prechains and applications
• Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic
• Description of the digraphs \(\{-1\}\)-hypomorphic to a reducible digraph

This page was built for publication: The \({-k}\)-self-duality of finite lexicographic sums of tournaments under a 3-cycle or a critical tournament

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