On bipartite biregular large graphs derived from difference sets

DOI10.1002/JGT.23263MaRDI QIDQ6938667zbMATH OpenFDO

Authors G. Araujo-Pardo, C. Dalfó, Miquel Angel Fiol, Nacho López

Publication date 25 August 2025

Published in Journal of Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1002/JGT.23263

zbMATH Keywords

diameteradjacency spectrumMoore boundbipartite biregular graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)

Cites work

• scientific article; zbMATH DE number 3857150 (Why is no real title available?)
• scientific article; zbMATH DE number 205894 (Why is no real title available?)
• scientific article; zbMATH DE number 3069342 (Why is no real title available?)
• A Theorem in Finite Projective Geometry and Some Applications to Number Theory
• A course in combinatorics.
• Bipartite biregular Moore graphs
• Difference sets. Connecting algebra, combinatorics, and geometry
• Graphs derived from perfect difference sets
• ON PERFECT DIFFERENCE SETS
• On Graphs that do not Contain a Thomsen Graph

This page was built for publication: On bipartite biregular large graphs derived from difference sets

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