Distance-regular graphs and (s,c,a,k)-graphs
From MaRDI portal
Publication:1838981
DOI10.1016/0095-8956(83)90015-1zbMath0511.05052OpenAlexW2018192628MaRDI QIDQ1838981
Publication date: 1983
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(83)90015-1
Related Items
A distance-regular graph with bipartite geodetically closed subgraphs., On strongly closed subgraphs of highly regular graphs, A remark on bipartite distance-regular graphs of even valency, Intersection numbers of bipartite distance-regular graphs, On bounding the diameter of a distance-regular graph, On 2-transitive graphs of girth 5, A characterization of the odd graphs and the doubled odd graphs with a few of their intersection numbers, On distance-regular graphs with \(k_ i= k_ j\). II, P and Q polynomial schemes with \(q=-1\), A unified view of inequalities for distance-regular graphs. I, A new inequality for bipartite distance-regular graphs., On subgraphs in distance-regular graphs, Coverings and homotopy of a graph, Some interlacing results for the eigenvalues of distance-regular graphs, Applications of the retracing method for distance-regular graphs, Graph theory (algorithmic, algebraic, and metric problems), On 2-walk-regular graphs with a large intersection number \(c_2\), Root systems and the Johnson and Hamming graphs, On uniformly geodetic graphs, A characterization of the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by strongly closed subgraphs, Distance-regular graphs with girth 3 or 4: I
Cites Work
