2021/10/05 by Jeepamol J. Palathingal, Palathingal, Jeepamol J, Aparna Lakshmanan S +3
Computer Science · Mathematics · Neuroscience · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Graph theory and applications #Nuclear Receptors and Signaling #Rings, Modules, and Algebras
paper · pdf · doi:10.48550/arxiv.2110.02101
openalex publication_date 2021/10/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The graph G is said to be strongly regular with parameters\n(n,k,\λ,\μ) if the following conditions hold:\n (1) each vertex has k neighbours; (2) any two adjacent vertices of G have\n\λ common neighbours; (3) any two non-adjacent vertices of G have\n\μ common neighbours.\n In this paper we study two weaker notions of strongly regular graphs. A graph\nsatisfying the conditions (1) and (2) is called an edge-regular graph with\nparameters (n,k,\λ). We call a graph satisfying the conditions (1) and\n(3) a pseudo strongly regular graph with parameters (n,k,\μ). In this\npaper we study the impact of various graph operations on edge regular graphs\nand pseudo strongly regular graphs.\n