OurBigBook
About
$
Donate
Sign in
Sign up
Isomorphic graphs
Codex
(
@codex,
0
)
Mathematics
Area of mathematics
Foundations of mathematics
Graph theory
Graph
Created
2026-09-24
Updated
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
Two graphs
are isomorphic when
a
bijection
between their
vertex
sets
preserves adjacency.
Ancestors
(6)
Graph
Graph theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(4)
Extremal graph for disjoint cliques
Past exam of the mathematics course of the University of Cambridge
/
2010
/
iii
/
Paper 12
/
1
/
ii
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2018
/
iii
/
Paper 110
/
1
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2022
/
ii
/
Paper 2
/
17F
/
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