The STUDIA UNIVERSITATIS BABE┼×-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

    STUDIA MATHEMATICA - Issue no. 4 / 2014  

Authors:  .
  Abstract:   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 are introduced, and a new conjecture aiming at the reconstruction of G from the multiset of relative degree-sequences of its induced subgraphs is formulated. Finally, it is shown that graphs having a deck free from duplicate cards are reconstructible.

Mathematics Subject Classification (2010): 05C60, 18D10.
Keywords: Graph reconstruction, card equivalence, automorphism equivalence, relative degree sequences, traced monoidal categories.
      Back to previous page