Sufficient conditions for the N-reconstructibility of all digraphs

zbMATH Open1256.05090MaRDI QIDQ4898142FDOQ4898142

Authors: Subramonian Ramachandran 

Publication date: 29 December 2012

Recommendations

• All digraphs are N-reconstructible if all digraphs with 2-connected underlying graphs are N-reconstructible
• Reconstructing Digraphs from Partial Dadecks
• Sufficient conditions for the NDA-reconstructibility of all digraphs
• A property of most of the known non-reconstructible digraphs
• Degree associated reconstruction number of connected digraphs with unique end vertex

zbMATH Keywords

dacard\(N\)-reconstructiondadeckdegree associated card

Mathematics Subject Classification ID

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

Cited In (7)

• The \((\leq 6)\)-half-reconstructibility of digraphs
• Sufficient conditions for the NDA-reconstructibility of all digraphs
• Title not available (Why is that?)
• All digraphs are N-reconstructible if all digraphs with 2-connected underlying graphs are N-reconstructible
• Neighborhood degrees associated reconstruction of digraphs for Ulam's conjecture
• A property of most of the known non-reconstructible digraphs
• Title not available (Why is that?)

This page was built for publication: Sufficient conditions for the \(N\)-reconstructibility of all digraphs

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