On (almost) \(2\)-\(Y\)-homogeneous distance-biregular graphs (Q2111894): Difference between revisions

Let \(\Gamma\) be a bipartite graph with vertex set \(X\) and partite sets \(Y\), \(Y^\prime\). For any \(x\in X\), let \(\Gamma_i(x)=\{y\in X: d(y,x)=i\}\). Let \(x\in Y\), \(y\in \Gamma_2(x)\) and \(z\in \Gamma_i(x)\cap \Gamma_i(y)\). Let \(\gamma_i(x,y,z)=|\Gamma_1(x)\cap \Gamma_1(y)\cap \Gamma_{(i-1)}(z)|\). Suppose every vertex in \(Y\) has eccentricity \(D\geq 3\). The graph \(\Gamma\) is called almost 2-\(Y\)-homogeneous if for all \(i\) with \(1\leq i\leq D-2\) for all \(x\in X\), \(y\in \Gamma_2(x)\) and for all \(z\in \Gamma_i(x)\cap \Gamma_i(y)\), the number \(\gamma_i(x,y,z)\) is independent of the choice of \(x\), \(y\) and \(z\). If further the above condition holds for \(i=D-1\), then the graph \(\Gamma\) is called 2-\(Y\)-homogeneous. In this paper, the authors present several results on the combinatorial structure of distance biregular graphs which are almost 2-\(Y\)-homogeneous and 2-\(Y\)-homogeneous. Open problems for further research are also given.