Loading...

Almost every n -vertex graph is determined by Its 3 log 2 n -vertex subgraphs

Farhadian, A ; Sharif University of Technology | 2020

174 Viewed
  1. Type of Document: Article
  2. DOI: 10.1142/S012905412050029X
  3. Publisher: World Scientific , 2020
  4. Abstract:
  5. This paper proves that almost every n-vertex graph has the property that the multiset of its induced subgraphs on 3log2n vertices is sufficient to determine it up to isomorphism. That is, the probability that there exists two n-vertex graphs with the same multiset of 3log2n-vertex induced subgraphs goes to zero as n goes to infinity. © 2020 World Scientific Publishing Company
  6. Keywords:
  7. Graph asymmetry ; Graph isomorphism ; Graph reconstruction ; Random graph ; Unique subgraph
  8. Source: International Journal of Foundations of Computer Science ; Volume 31, Issue 5 , 2020 , Pages 611-619
  9. URL: https://www.worldscientific.com/doi/abs/10.1142/S012905412050029X