Reconstructing graphs from a deck of all distinct cards

@inproceedings{Bartha2014ReconstructingGF,
  title={Reconstructing graphs from a deck of all distinct cards},
  author={Mikl{\'o}s Bartha and Amitesh S. Shuva},
  year={2014}
}
The graph reconstruction conjecture is looked at from a new perspective. Given a graph G, three equivalence relations are considered on V (G): card equivalence, automorphism equivalence, and the equivalence of having the same behavior. A structural characterization of card equivalence in terms of automorphism equivalence is worked out. Relative degree-sequences of subgraphs of G are introduced, and a new conjecture aiming at the reconstruction of G from the multiset of relative degree-sequences… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

A congruence theorem for trees

P. J. Kelly
Pacific J. Math., • 1957
View 2 Excerpts
Highly Influenced

The monoidal structure of Turing machines

Mathematical Structures in Computer Science • 2013
View 2 Excerpts

Traced monoidal categories, Math

A. Joyal, R. Street, D. Verity
Proc. Camb. Phil. Soc., • 1996
View 2 Excerpts

Almost every graph has reconstruction number three

Journal of Graph Theory • 1990
View 1 Excerpt

Axiomatizing Schemes and Their Behaviors

J. Comput. Syst. Sci. • 1985
View 2 Excerpts

On a new digraph reconstruction conjecture

S. Ramachandran
Journal of Combinatorial Theory, B31(1981), • 1981
View 1 Excerpt

Similar Papers

Loading similar papers…