Description of the digraphs \-1\-hypomorphic to a reducible digraph

MaRDI QIDQ6939834zbMATH OpenFDO

Authors Mouna Achour, Youssef Boudabbous, Abderrahim Boussaïri

Publication date 20 August 2025

Published in Journal of Multiple-Valued Logic and Soft Computing (Search for Journal in Brave)

Full work available at URL https://www.oldcitypublishing.com/journals/mvlsc-home/mvlsc-issue-contents/mvlsc-volume-42-number-4-2024/mvlsc-42-4-p-349-373/

zbMATH Keywords

\(\{-1\}\)-hypomorphyGallai's decompositionisomorphismreconstructionreducible digraphs

Mathematics Subject Classification ID

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

Cites work

• A congruence theorem for trees
• A translation of Gallai's paper: `Transitiv orientierbare Graphen'
• Graph reconstruction—a survey
• scientific article; zbMATH DE number 417290 (Why is no real title available?)
• scientific article; zbMATH DE number 3141308 (Why is no real title available?)
• scientific article; zbMATH DE number 5704233 (Why is no real title available?)
• scientific article; zbMATH DE number 17789 (Why is no real title available?)
• scientific article; zbMATH DE number 1952951 (Why is no real title available?)
• Isomorphy and dilatation in digraphs
• LA RECONSTRUCTION DES TOURNOIS SANS DIAMANT
• On the problem of reconstructing a tournament from subtournaments
• Primitivity is hereditary for 2-structures
• Reconstruction from the deck of k-vertex induced subgraphs
• The (-1)-critical tournaments
• The \(C_{3}\)-structure of the tournaments.
• The \({-k}\)-self-duality of finite lexicographic sums of tournaments under a 3-cycle or a critical tournament
• The falsity of the reconstruction conjecture for tournaments
• The half-isomorphy and the finite strongly connected tournaments
• The minimal non-( k)-reconstructible relations
• Transitiv orientierbare Graphen
• Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic

This page was built for publication: Description of the digraphs \(\{-1\}\)-hypomorphic to a reducible digraph

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