On a new digraph reconstruction conjecture

DOI10.1016/S0095-8956(81)80019-6zbMath0474.05053DBLPjournals/jctb/Ramachandran81OpenAlexW2955171540WikidataQ59485431 ScholiaQ59485431MaRDI QIDQ1159216

S. H. Smith

Publication date: 1981

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0095-8956(81)80019-6

zbMATH Keywords

tournamentsdigraph reconstruction conjecturedegree pair

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 (12)

Generalisations of hypomorphisms and reconstruction of hypergraphs ⋮ Degree associated reconstruction number of certain connected graphs with unique end vertex and a vertex of degree n−2 ⋮ A property of most of the known non-reconstructible digraphs ⋮ Seurat games on Stockmeyer graphs ⋮ Unnamed Item ⋮ Degree-associated reconstruction number of graphs ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Graphs with arbitrarily large adversary degree associated reconstruction number ⋮ Adversary degree associated reconstruction number of graphs ⋮ N-reconstructibility of non-reconstructible digraphs ⋮ Degree associated edge reconstruction number of split graphs with biregular independent set is one ⋮ Some results and approaches for reconstruction conjectures

Cites Work

• Unnamed Item
• Unnamed Item
• A census of non-reconstructable digraphs. I: Six related families
• On Ulam's conjecture for separable graphs
• Determining connectedness from subdigraphs
• The falsity of the reconstruction conjecture for tournaments
• On nonreconstructable tournaments

This page was built for publication: On a new digraph reconstruction conjecture