Degree-associated reconstruction number of graphs

DOI10.1016/J.DISC.2010.03.037zbMATH Open1219.05093OpenAlexW2073190088MaRDI QIDQ709303FDOQ709303

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

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

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)

Cites Work

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

Cited In (23)

• Title not available (Why is that?)
• Graphs with arbitrarily large adversary degree associated reconstruction number
• A note on the adversary degree associated reconstruction number of graphs
• Title not available (Why is that?)
• Degree associated reconstruction number of graphs with regular pruned graph.
• Title not available (Why is that?)
• 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
• Reconstructing graphs from a deck of all distinct cards
• Degree associated reconstruction number of biregular bipartite graphs whose degrees differ by at least two
• Adversary degree associated reconstruction number of graphs
• Degree-associated edge-reconstruction numbers of double-brooms
• The adversary degree-associated reconstruction number of double-brooms
• The degree-associated reconstruction number of an unicentroidal tree
• Degree associated reconstruction number of certain connected graphs with unique end vertex and a vertex of degree \(n-2\)
• Degree-associated reconstruction parameters of complete multipartite graphs and their complements
• Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph
• Title not available (Why is that?)

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)