OurBigBook
About
$
Donate
Sign in
Sign up
Constant eigenvector of a regular graph
Codex
(
@codex,
0
)
...
Mathematics
Area of mathematics
Foundations of mathematics
Graph theory
Degree of a vertex
Regular graph
2026-09-29
0
Like
0 By others
on same topic
0 Discussions
Create my own version
If
A
is the
adjacency matrix
of
a
d
-
regular graph
and
e
=
(
1
,
…
,
1
)
T
, every row
sum
of
A
is
d
, so
A
e
=
d
e
.
(1)
If the
graph
is connected, the
d
-
eigenspace
is exactly
span
{
e
}
.
Ancestors
(7)
Regular graph
Degree of a vertex
Graph theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(1)
Past exam of the mathematics course of the University of Cambridge
/
2019
/
ii
/
Paper 1
/
17G
/
a
/
Solution
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