Alternative Proofs of a Theorem of Bose and Dowling for Strongly Regular Graphs.

Saved in:
Bibliographic Details
Title: Alternative Proofs of a Theorem of Bose and Dowling for Strongly Regular Graphs.
Authors: TALBI, MALIK1 mtalbi@ksu.edu.sa
Source: Journal of Multiple-Valued Logic & Soft Computing. 2025, Vol. 46 Issue 5/6, p601-608. 8p.
Subjects: Graph theory, Regular graphs, Graph connectivity
Abstract: In this paper, we give two proofs of a theorem of Bose and Dowling on non necessarily regular graphs satisfying the two other conditions of strong regularity. This theorem states that a simple graph for which there exist two non-negative entegers λ and μ such that any two adjacent vertices have exactly λ common neighbors and any two nonadjacent vertices have exactly μ common neighbors, is regular except for some cases that can be considered as trivial. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Multiple-Valued Logic & Soft Computing is the property of Old City Publishing, Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:In this paper, we give two proofs of a theorem of Bose and Dowling on non necessarily regular graphs satisfying the two other conditions of strong regularity. This theorem states that a simple graph for which there exist two non-negative entegers λ and μ such that any two adjacent vertices have exactly λ common neighbors and any two nonadjacent vertices have exactly μ common neighbors, is regular except for some cases that can be considered as trivial. [ABSTRACT FROM AUTHOR]
ISSN:15423980