Degree-associated reconstruction number of graphs

DOI10.1016/J.DISC.2010.03.037MaRDI QIDQ709303zbMATH OpenOpenAlexFDO

Authors Michael D. Barrus, Douglas B. West

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

treevertex-transitive graphcaterpillarreconstruction numberreconstruction conjecture

Mathematics Subject Classification ID

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

Recommendations

• Degree associated reconstruction number of graphs with regular pruned graph.
• Degree associated reconstruction parameters of total graphs
• Reconstruction number for Ulam's conjecture.
• A note on the adversary degree associated reconstruction number of graphs
• Degree associated reconstruction number of biregular bipartite graphs whose degrees differ by at least two

Cites work

• scientific article; zbMATH DE number 3141308 (Why is no real title available?)
• scientific article; zbMATH DE number 4154485 (Why is no real title available?)
• scientific article; zbMATH DE number 17789 (Why is no real title available?)
• scientific article; zbMATH DE number 822735 (Why is no real title available?)
• scientific article; zbMATH DE number 1409202 (Why is no real title available?)
• scientific article; zbMATH DE number 2188393 (Why is no real title available?)
• A congruence theorem for trees
• A survey on edge reconstruction of graphs
• Almost every graph has reconstruction number three
• Graph reconstruction numbers
• Graph reconstruction—a survey
• N-reconstructibility of non-reconstructible digraphs
• ON THE CLASS-RECONSTRUCTION NUMBER OF TREES
• On a new digraph reconstruction conjecture
• Reconstructing trees from two cards
• Reconstruction number for Ulam's conjecture.
• The ally-reconstruction number of a tree with five or more vertices is three
• The degree sequence is reconstructible from \(n-1\) cards
• The graph reconstruction number

Cited in

(23)

• Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph
• scientific article; zbMATH DE number 4154485 (Why is no real title available?)
• scientific article; zbMATH DE number 7644293 (Why is no real title available?)
• Graphs with arbitrarily large adversary degree associated reconstruction number
• A note on the adversary degree associated reconstruction number of graphs
• scientific article; zbMATH DE number 5077152 (Why is no real title available?)
• Degree associated reconstruction number of graphs with regular pruned graph.
• scientific article; zbMATH DE number 5942198 (Why is no real title available?)
• Degree associated reconstruction number of graphs obtained by certain graph operations
• The graph reconstruction number
• Reconstruction number for Ulam's conjecture.
• Degree associated edge reconstruction number of split graphs with biregular independent set is one
• Degree associated reconstruction parameters of total graphs
• Reconstructing the degree sequence of a sparse graph from a partial deck
• Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices
• Degree associated reconstruction number of biregular bipartite graphs whose degrees differ by at least two
• Reconstructing graphs from a deck of all distinct cards
• Degree-associated edge-reconstruction numbers of double-brooms
• Adversary degree associated reconstruction number of graphs
• The adversary degree-associated reconstruction number of double-brooms
• Degree associated reconstruction number of certain connected graphs with unique end vertex and a vertex of degree \(n-2\)
• The degree-associated reconstruction number of an unicentroidal tree
• Degree-associated reconstruction parameters of complete multipartite graphs and their complements

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

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