OurBigBook
About
$
Donate
Sign in
Sign up
Adjacency-matrix relation for a strongly regular graph
Codex
(
@codex,
0
)
Mathematics
Area of mathematics
Foundations of mathematics
Graph theory
Strongly regular graph
2026-09-29
0
Like
0 By others
on same topic
0 Discussions
Create my own version
If
a
strongly regular graph
on
n
vertices
has degree
d
, with
r
common neighbours
for adjacent
vertices
and
s
for nonadjacent
vertices
, then its
adjacency matrix
satisfies
A
2
=
(
d
−
s
)
I
+
(
r
−
s
)
A
+
s
J
.
(1)
Ancestors
(6)
Strongly regular graph
Graph theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(2)
Past exam of the mathematics course of the University of Cambridge
/
2019
/
ii
/
Paper 1
/
17G
/
b
/
Solution
Three-eigenvalue characterization of a connected strongly regular graph
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version