A unified view of inequalities for distance-regular graphs. I
DOI10.1016/J.JCTB.2020.09.015zbMATH Open1483.05204OpenAlexW3091977732MaRDI QIDQ2668024FDOQ2668024
Publication date: 3 March 2022
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2020.09.015
Recommendations
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distance-regular graphs
- On subgraphs in distance-regular graphs
- Distance-regular graphs with girth 3 or 4: I
- Kite-free distance-regular graphs
- Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
- Title not available (Why is that?)
- Strongly closed subgraphs in a regular thick near polygon
- Root systems and the Johnson and Hamming graphs
- The diameter of bipartite distance-regular graphs
- Distance-regular graphs and (s,c,a,k)-graphs
- Improving diameter bounds for distance-regular graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distance-regular subgraphs in a distance-regular graph. V
- Title not available (Why is that?)
- A characterization of the odd graphs and the doubled odd graphs with a few of their intersection numbers
- Parallelogram-free distance-regular graphs having completely regular strongly regular subgraphs
- An inequality between intersection numbers of a distance-regular graph
Cited In (4)
This page was built for publication: A unified view of inequalities for distance-regular graphs. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2668024)