Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

DM
2010

favoriteEmaildiscussreport

107views more DM 2010»

Degree-associated reconstruction number of graphs

13 years 4 months ago

Degree-associated reconstruction number of graphs

Download www.math.uiuc.edu

A card of a graph G is a subgraph formed by deleting one vertex. The Reconstruction Conjecture states that each graph with at least three vertices is determined by its multiset of cards. A dacard specifies the degree of the deleted vertex along with the card. The degree-associated reconstruction number drn(G) is the minimum number of dacards that determine G. We show that drn(G) = 2 for almost all graphs and deter

Michael D. Barrus, Douglas B. West

Real-time Traffic

Card | Degree-associated Reconstruction Number | DM 2010 | Reconstruction Conjecture |

claim paper

Related Content

» The Characteristic Polynomial of a Graph is Reconstructible from the Characteristic Polyno...

» Topology Discovery of Sparse Random Graphs With Few Participants

» Applications of graph theory to an English rhyming corpus

» Hierarchical Volumetric Multiview Stereo Reconstruction of Manifold Surfaces based on Dual...

» Vertex reconstruction in Cayley graphs

» Reconstructing Many Partitions Using Spectral Techniques

» A Network Flow Algorithm for Reconstructing Binary Images from Continuous Xrays

» Private social network analysis how to assemble pieces of a graph privately

» Optimally Reconstructing Weighted Graphs Using Queries

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	DM
Authors	Michael D. Barrus, Douglas B. West

Comments (0)