IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i6p970-d1612723.html
   My bibliography  Save this article

On Strongly Regular Graphs and the Friendship Theorem

Author

Listed:
  • Igal Sason

    (Andrew & Erna Viterbi Faculty of Electrical and Computer Engineering, Technion—Israel Institute of Technology, Haifa 3200003, Israel
    Faculty of Mathematics, Technion—Israel Institute of Technology, Haifa 3200003, Israel)

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.

Suggested Citation

  • Igal Sason, 2025. "On Strongly Regular Graphs and the Friendship Theorem," Mathematics, MDPI, vol. 13(6), pages 1-21, March.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:6:p:970-:d:1612723
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/6/970/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/6/970/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2025:i:6:p:970-:d:1612723. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.