A property of most of the known non-reconstructible digraphs

DOI10.1080/09728600.2022.2057259zbMath1487.05182OpenAlexW4224231043MaRDI QIDQ5074884

No author found.

Publication date: 10 May 2022

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09728600.2022.2057259

zbMATH Keywords

carddigraphpastingisomorphic pastingsunique non-isomorphic hypomorph

Mathematics Subject Classification ID

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

Related Items (1)

Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• N-reconstructibility of non-reconstructible digraphs
• Hypomorphisms, orbits, and reconstruction
• A census of non-reconstructable digraphs. I: Six related families
• On a new digraph reconstruction conjecture
• The degree sequence is reconstructible from \(n-1\) cards
• The size of a graph is reconstructible from any \(n-2\) cards
• Towards size reconstruction from fewer cards
• Reconstructing the degree pair sequence of a digraph
• The falsity of the reconstruction conjecture for tournaments
• Graph reconstruction—a survey

This page was built for publication: A property of most of the known non-reconstructible digraphs