Distance regularity in direct-product graphs
Let \(G=(V,E)\) and \(H=(W,F)\) be graphs. The direct product \(G\times H\) of \(G\) and \(H\) is defined as follows: \(V(G\times H)=V\times W\) and \(E(G\times H)=\{\{(u,x),(v,y)\}:\{u,v\}\in E, \{x,y\}\in F\}\). In this paper the following results are obtained. If \(G\) and \(H\) are distance regular graphs of diameter at least two, then \(G\times H\) or a component of \(G\times H\) is distance regular iff each of \(G\) and \(H\) is isomorphic to \(K_{n,n}\) for some \(n\). If \(G\) is a distance regular graph of diameter at least two and \(n\geq 3\), then \(G\times K_n\) is not distance regular.
- scientific article; zbMATH DE number 3920514
- scientific article; zbMATH DE number 43547
- Distance-regular graphs
- Two results concerning distance-regular directed graphs
- Distance-regularity and the spectrum of graphs
- scientific article; zbMATH DE number 4106886
- Distance regularity of compositions of graphs.
- On almost distance-regular graphs
- Some inequalities in distance-regular graphs
- Distance regularity of compositions of graphs.
- Addressing graph products and distance-regular graphs
- The least Euclidean distortion constant of a distance-regular graph
- Two results concerning distance-regular directed graphs
- scientific article; zbMATH DE number 3884209 (Why is no real title available?)
- The generalized distance spectrum of a graph and applications
- Distance degree graphs in the Cartesian product of graphs
- Distance formula for direct-co-direct product in the case of disconnected factors
This page was built for publication: Distance regularity in direct-product graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1972446)
