Degree-associated reconstruction number of graphs

DOI10.1016/j.disc.2010.03.037zbMath1219.05093OpenAlexW2073190088MaRDI QIDQ709303

Douglas B. West, Michael D. Barrus

Publication date: 18 October 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.03.037

zbMATH Keywords

treereconstruction conjecturecaterpillarvertex-transitive graphreconstruction number

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (7)

Degree associated reconstruction number of certain connected graphs with unique end vertex and a vertex of degree n−2 ⋮ Unnamed Item ⋮ The adversary degree-associated reconstruction number of double-brooms ⋮ A note on the adversary degree associated reconstruction number of graphs ⋮ Graphs with arbitrarily large adversary degree associated reconstruction number ⋮ Adversary degree associated reconstruction number of graphs ⋮ Degree associated edge reconstruction number of split graphs with biregular independent set is one

Cites Work

• A congruence theorem for trees
• N-reconstructibility of non-reconstructible digraphs
• On a new digraph reconstruction conjecture
• The degree sequence is reconstructible from \(n-1\) cards
• Almost every graph has reconstruction number three
• The ally-reconstruction number of a tree with five or more vertices is three
• ON THE CLASS-RECONSTRUCTION NUMBER OF TREES
• The graph reconstruction number
• Graph reconstruction—a survey
• A survey on edge reconstruction of graphs
• Reconstructing trees from two cards
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Degree-associated reconstruction number of graphs