Supremal p-negative type of vertex transitive graphs

From MaRDI portal
Publication:412438




Abstract: We study the generalized roundness of finite metric spaces whose distance matrix D has the property that every row of D is a permutation of the first row. The analysis provides a way to characterize subsets of the Hamming cube 0,1nsubsetell1(n) (ngeq1) that have strict 1-negative type. The result can be stated in two ways: a subset S=vcx0,vcx1,ldots,vcxk of the Hamming cube 0,1nsubsetell1(n) has generalized roundness one if and only if the vectors vcx1vcx0,vcx2vcx0,ldots,vcxkvcx0 are linearly dependent in mathbbRn. Equivalently, S has strict 1-negative type if and only if the vectors vcx1vcx0,vcx2vcx0,ldots,vcxkvcx0 are linearly independent in mathbbRn.









This page was built for publication: Supremal \(p\)-negative type of vertex transitive graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412438)