29 citations · 53 across the 27 of their papers we have counts for
1 paper · 1 filter
I. Yu. Mogilnykh, K. V. Vorob'ev
We prove that any completely regular code with minimum eigenvalue in any geometric graph G corresponds to a completely regular code in the clique graph of G. Studying the interrela…