On Strongly Regular Graphs and the Friendship Theorem
Igal Sason ()
Additional contact information
Igal Sason: Andrew & Erna Viterbi Faculty of Electrical and Computer Engineering, Technion—Israel Institute of Technology, Haifa 3200003, Israel
Mathematics, 2025, vol. 13, issue 6, 1-21
Abstract:
This paper presents an alternative proof of the celebrated friendship theorem, originally established by Erdős, Rényi, and Sós in 1966. The proof relies on a closed-form expression for the Lovász ϑ -function of strongly regular graphs, recently derived by the author. Additionally, this paper considers some known extensions of the theorem, offering discussions that provide insights into the friendship theorem, one of its extensions, and the proposed proof. Leveraging the closed-form expression for the Lovász ϑ -function of strongly regular graphs, this paper further establishes new necessary conditions for a strongly regular graph to be a spanning or induced subgraph of another strongly regular graph. In the case of induced subgraphs, the analysis also incorporates a property of graph energies. Some of these results are extended to regular graphs and their subgraphs.
Keywords: friendship theorem; strongly regular graph; Lovász ϑ-function; windmill graph; graph invariants; graph energy; spanning subgraph; induced subgraph (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: View complete reference list from CitEc
Citations:
Downloads: (external link)
https://www.mdpi.com/2227-7390/13/6/970/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/6/970/ (text/html)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:6:p:970-:d:1612723
Access Statistics for this article
Mathematics is currently edited by Ms. Emma He
More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().