Graph reconstruction -- some new developments

MaRDI QIDQ1772201zbMATH OpenFDO

Authors Xianqiang Yang, Subramonian Ramachandran

Publication date 15 April 2005

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

digraphsedge reconstructionreconstruction numbersreconstruction problemvertex switching

Mathematics Subject Classification ID

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

Recommendations

• Progress on the reconstruction conjecture
• Graph reconstruction from subgraphs
• Some results and approaches for reconstruction conjectures
• Reconstruction conjecture-present trends of research
• The graph reconstruction number

Cited in

(67)

• Similarity reconstruction of trees
• Reconstruction of hypertrees
• Balance equations for reconstruction problems
• A note on the vertex-switching reconstruction
• Disproof of a conjecture in graph reconstruction theory
• Reconstituting beta graphs into an efficacious system
• Some results and approaches for reconstruction conjectures
• Some work towards the proof of the reconstruction conjecture
• Edge-recognizable domination numbers.
• On switching classes of graphs
• Reconstruction of Boolean formulas in conjunctive normal form
• Finite-type invariants for graphs and graph reconstructions
• On the weak reconstruction of Cartesian-product graphs
• The reconstruction conjecture for finite simple graphs and associated directed graphs
• Reconstruction number of graphs with unique pendant vertex
• Rigidity and reconstruction for graphs
• Some results on the spectral reconstruction problem
• An algebraic formulation of the graph reconstruction conjecture
• Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph
• Edge reconstruction and the swapping number of a graph
• A topological variation of the reconstruction conjecture
• Reconstruction conjecture-present trends of research
• The vertex and edge graph reconstruction numbers of small graphs
• Graph reconstruction by permutations
• A survey of some open questions in reconstruction numbers.
• Bipartite permutation graphs are reconstructible
• The converse of Kelly's lemma and control-classes in graph reconstruction
• scientific article; zbMATH DE number 4135984 (Why is no real title available?)
• Almost every graph has reconstruction number three
• scientific article; zbMATH DE number 4162922 (Why is no real title available?)
• scientific article; zbMATH DE number 5504379 (Why is no real title available?)
• scientific article; zbMATH DE number 3912429 (Why is no real title available?)
• scientific article; zbMATH DE number 3948325 (Why is no real title available?)
• scientific article; zbMATH DE number 4004221 (Why is no real title available?)
• scientific article; zbMATH DE number 4063134 (Why is no real title available?)
• scientific article; zbMATH DE number 4068923 (Why is no real title available?)
• scientific article; zbMATH DE number 4077274 (Why is no real title available?)
• Class-reconstruction of total graphs
• scientific article; zbMATH DE number 4097430 (Why is no real title available?)
• scientific article; zbMATH DE number 17789 (Why is no real title available?)
• scientific article; zbMATH DE number 1146222 (Why is no real title available?)
• A survey on edge reconstruction of graphs
• scientific article; zbMATH DE number 772776 (Why is no real title available?)
• scientific article; zbMATH DE number 1409216 (Why is no real title available?)
• Progress on the reconstruction conjecture
• scientific article; zbMATH DE number 7604997 (Why is no real title available?)
• Reconstructing graphs from a deck of all distinct cards
• Reconstruction of small graphs and digraphs
• On the uniqueness of exact vertex extensions
• Switching reconstruction of digraphs
• The edge-subgraph poset of a graph and the edge reconstruction conjecture
• Complexity results in graph reconstruction
• Reconstruction of pseudographs
• New problems of graph reconstruction
• Switching reconstruction of digraphs
• scientific article; zbMATH DE number 971397 (Why is no real title available?)
• The reconstruction number of a lexicographic sum of cliques
• Graph reconstruction from subgraphs
• Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs
• An algorithm to recover shredded random matrices
• Decks of rooted binary trees
• Reconstruction of caterpillar tanglegrams
• Complexity results in graph reconstruction
• Reconstructing graphs from size and degree properties of their induced \(k\)-subgraphs
• Vertex-switching reconstruction of subgraph numbers and triangle-free graphs
• Reconstruction of a graph from 2-vicinities of its vertices
• The reconstruction conjecture and edge ideals

This page was built for publication: Graph reconstruction -- some new developments

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