A characterization of bipartite graphs associated with BIB-designs with \(\lambda\)=1

DOI10.1016/0012-365X(93)90244-NzbMath0779.05040OpenAlexW2056193901MaRDI QIDQ1210576

Raffaele Scapellato

Publication date: 30 August 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90244-n

zbMATH Keywords

treedistanceshortest pathsBIB-design\(F\)-geodetic graphdistance- regular graph

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Structural characterization of families of graphs (05C75)

Cites Work

• \((0,\lambda)\)-graphs and \(n\)-cubes
• Interval-regular graphs
• Geodetic graphs of diameter two and some related structures
• On \(F\)-geodetic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A characterization of bipartite graphs associated with BIB-designs with \(\lambda\)=1