scientific article; zbMATH DE number 6930600

MaRDI QIDQ4583890zbMATH OpenFDO

Authors Youssef Boudabbous, Abderrahim Boussaïri, Abdelhak Chaïchaâ, Nadia El Amri

Publication date 3 September 2018

Full work available at URL http://www.oldcitypublishing.com/journals/mvlsc-home/mvlsc-issue-contents/mvlsc-volume-27-number-5-6-2016/mvlsc-27-5-6-p-501-530/

zbMATH Keywords

autonomous sethereditarily self-dual modulehereditary reconstruction up to dualitymodulereconstruction up to dualitytournament

Mathematics Subject Classification ID

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

Recommendations

• Half-isomorphy, selfduality and finite non strongly connected tournaments
• The \(\{-3\}\)-reconstruction and the \(\{-3\}\)-self duality of tournaments.
• The \(\{-2,-1\}\)-selfdual and decomposable tournaments
• scientific article; zbMATH DE number 1064697
• Self-duality and co-multiplication lattices
• A Duality for Self-Slender Modules
• scientific article; zbMATH DE number 3904708
• On the self-dual maximal Cohen-Macaulay modules
• A note on self-dual modules and Dedekind rings
• scientific article; zbMATH DE number 4063348

Cited in

(7)

• The \(\{-2,-1\}\)-selfdual and decomposable tournaments
• The \((\leq 5)\)-hypomorphy of digraphs up to complementation
• Finite orders which are reconstructible up to duality by their comparability graphs
• The \(\{-3\}\)-reconstruction and the \(\{-3\}\)-self duality of tournaments.
• Description of the orders which are hereditarily half-reconstructible by their comparability graphs
• The \({-k}\)-self-duality of finite lexicographic sums of tournaments under a 3-cycle or a critical tournament
• ( k)-half-reconstructible tournaments for k 6

This page was built for publication:

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