Changes between Initial Version and Version 1 of Ticket #14619, comment 7


Ignore:
Timestamp:
May 20, 2013, 1:24:09 PM (9 years ago)
Author:
Dima Pasechnik
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #14619, comment 7

    initial v1  
    66what do you mean by "certificate"?
    77
    8 There is in fact and algebraic certificate of distance regularity, that is, the adjacency matrix A_k of the distance k graph of the original graph G is a polynomial in A_1 (the adjacency matrix of G). And these polynomials can be computed from the "intersection arrays". But that's a long story.
     8There is in fact an algebraic certificate of distance regularity, that is, the adjacency matrix A_k of the distance k graph of the original graph G is a polynomial in A_1 (the adjacency matrix of G). And these polynomials can be computed from the "intersection arrays". But that's a long story.