Let 𝒟 be a non-trivial simple t-design. For 1 ≤ 𝑠 ≤ 𝑡, we generalize the concept of the incidence graph of 𝒟 and construct a new bipartite regular graph Γ. We obtain that the edge-transitivity of ...

Graph theory isn’t enough. The mathematical language for talking about connections, which usually depends on networks — vertices (dots) and edges (lines connecting them) — has been an invaluable way ...