The distance spectra of Cayley graphs of Coxeter groups (Q533786): Difference between revisions

The distance matrix \(d_{\Gamma}=(d_{\Gamma}(u,v))\) of a graph \(\Gamma\) is the square matrix in which \(d_{\Gamma}(u,v)\) is the length of a shortest path between the vertices \(u\) and \(v\) in \(\Gamma\). The distance spectrum of \(\Gamma\) is the spectrum of the matrix \(d_{\Gamma}\). In the paper under review the author investigates the distance spectrum of the absolute order graph and the weak order graph, that is the graphs underlying the absolute Bruhat order and the weak Bruhat order, of several Coxeter groups.