Some inequalities in distance-regular graphs

DOI10.1006/JCTB.1993.1041zbMATH Open0793.05149OpenAlexW2016226295MaRDI QIDQ1325263FDOQ1325263

Authors: V. Pereyra 

Publication date: 10 August 1994

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1993.1041

Recommendations

• Distance-regular graphs with girth 3 or 4: I
• A new inequality for distance-regular graphs
• scientific article; zbMATH DE number 2192091
• A unified view of inequalities for distance-regular graphs. I

zbMATH Keywords

diameterdistance-regular graphgirthintersection numbers

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Cited In (15)

• A new inequality for distance-regular graphs
• A new inequality for bipartite distance-regular graphs.
• On local structure of a distance-regular graph of Hamming type
• A unified view of inequalities for distance-regular graphs. I
• Two results concerning distance-regular directed graphs
• Distance-regular graphs with girth 3 or 4: I
• An inequality involving the local eigenvalues of a distance-regular graph
• Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
• Distance regularity in direct-product graphs
• Title not available (Why is that?)
• An application of intersection diagrams of high rank
• Properties of graph distance measures by means of discrete inequalities
• Title not available (Why is that?)
• Some elementary inequalities for distance-regular graphs
• CIRCUIT CHASING TECHNIQUE FOR A DISTANCE-REGULAR GRAPH WITH c 2r+1=1

This page was built for publication: Some inequalities in distance-regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1325263)