Corpus ID: 222550814

1-Homogeneous Graphs with Cocktail Party -Graphs

  title={1-Homogeneous Graphs with Cocktail Party -Graphs},
  author={Juri{\vs}i{\'c}Aleksandar and KoolenJack},
Let be a graph with diameter d 2. Recall is 1-homogeneous (in the sense of Nomura) whenever for every edge xy of the distance partitionz V() (z, y) = i, (x, z) = j 0 i, j dis equitable and its para... 
1 Citations