AbstractA construction is given of distance-regular q-fold covering graphs of the complete bipartite graph Kqκ,qκ where q is the power of a prime number and κ is any positive integer. Relations with associated distance-biregular graphs are also considered, resulting in the construction of a family of distance-bitransitive graphs
This study is an exposition of Kazumasa Nomura\u27s article entitled Intersection Diagrams of Distan...
AbstractA distance-transitive antipodal cover of a complete graphKnpossesses an automorphism group t...
Let G be a bipartite distance-regular graph with bipartition V(G) = X ∪ Y. Let V(G′) = X and, for x ...
AbstractA construction is given of distance-regular q-fold covering graphs of the complete bipartite...
AbstractA characterization of distance-regular antipodal coverings of complete bipartite graphs is p...
AbstractDistance regular graphs fall into three families: primitive, antipodal, and bipartite. Each ...
AbstractAntipodal covers of strongly regular graphs which are not necessarily distance-regular are s...
Using a method by Godsil and Roy, bipartite distance-regular graphs of diameter four can be used to ...
AbstractWe investigate a class of (imprimitive) covering graphs Γ of complete bipartite graphs Kk,k ...
AbstractBipartite distance-regular graphs of valency three are classified. There are eight such grap...
AbstractOne problem with the theory of distance-regular graphs is that it does not apply directly to...
AbstractA distance-regular graph that is q-fold antipodal cover of a complete bipartite graph arises...
We show that distance-transitive q-fold antipodal coverings of the complete bipartite graph Kq,q are...
AbstractA graph G is called distance-regularized if each vertex of G admits an intersection array. I...
AbstractThis paper completes the classification of antipodal distance-transitive covers of the compl...
This study is an exposition of Kazumasa Nomura\u27s article entitled Intersection Diagrams of Distan...
AbstractA distance-transitive antipodal cover of a complete graphKnpossesses an automorphism group t...
Let G be a bipartite distance-regular graph with bipartition V(G) = X ∪ Y. Let V(G′) = X and, for x ...
AbstractA construction is given of distance-regular q-fold covering graphs of the complete bipartite...
AbstractA characterization of distance-regular antipodal coverings of complete bipartite graphs is p...
AbstractDistance regular graphs fall into three families: primitive, antipodal, and bipartite. Each ...
AbstractAntipodal covers of strongly regular graphs which are not necessarily distance-regular are s...
Using a method by Godsil and Roy, bipartite distance-regular graphs of diameter four can be used to ...
AbstractWe investigate a class of (imprimitive) covering graphs Γ of complete bipartite graphs Kk,k ...
AbstractBipartite distance-regular graphs of valency three are classified. There are eight such grap...
AbstractOne problem with the theory of distance-regular graphs is that it does not apply directly to...
AbstractA distance-regular graph that is q-fold antipodal cover of a complete bipartite graph arises...
We show that distance-transitive q-fold antipodal coverings of the complete bipartite graph Kq,q are...
AbstractA graph G is called distance-regularized if each vertex of G admits an intersection array. I...
AbstractThis paper completes the classification of antipodal distance-transitive covers of the compl...
This study is an exposition of Kazumasa Nomura\u27s article entitled Intersection Diagrams of Distan...
AbstractA distance-transitive antipodal cover of a complete graphKnpossesses an automorphism group t...
Let G be a bipartite distance-regular graph with bipartition V(G) = X ∪ Y. Let V(G′) = X and, for x ...