Reconstructing Digraphs from Partial Dadecks

DOI10.1016/S1571-0653(04)00562-1MaRDI QIDQ3439067zbMATH OpenOpenAlexFDO

Authors

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s1571-0653(04)00562-1

Mathematics Subject Classification ID

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

Recommendations

• On digraph reconstruction
• scientific article; zbMATH DE number 970793
• scientific article; zbMATH DE number 4016946
• Reconstruction of small graphs and digraphs
• On reconstruction of graphs
• scientific article; zbMATH DE number 772776
• On Reconstructing Graphs and Their Complements
• scientific article; zbMATH DE number 4208112
• Switching reconstruction of digraphs
• Switching reconstruction of digraphs

Cited in

(9)

• Sufficient conditions for the NDA-reconstructibility of all digraphs
• All digraphs are N-reconstructible if all digraphs with 2-connected underlying graphs are N-reconstructible
• scientific article; zbMATH DE number 4162908 (Why is no real title available?)
• scientific article; zbMATH DE number 4023320 (Why is no real title available?)
• Digraph isomorphism using subdigraph equivalent vertices and degree pair association.
• Degree associated reconstruction number of connected digraphs with unique end vertex
• Neighborhood degrees associated reconstruction of digraphs for Ulam's conjecture
• Sufficient conditions for the N-reconstructibility of all digraphs
• Reconstruction number for Ulam's conjecture.

This page was built for publication: Reconstructing Digraphs from Partial Dadecks

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