OurBigBook About$ Donate
 Sign in Sign up

Petersen graph

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Graph theory Degree of a vertex Regular graph
2026-10-05  1 By others on same topic  0 Discussions Create my own version
The graph whose vertices are two-element subsets of a five-element set, with two vertices adjacent when the subsets are disjoint. It has ten vertices, degree three, zero common neighbours for adjacent pairs and one for nonadjacent pairs. Its adjacency matrix of a graph satisfies A2+A−2I=J and has eigenvalues 3,1,−2 of multiplicities 1,5,4.

 Ancestors (7)

  1. Regular graph
  2. Degree of a vertex
  3. Graph theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2017 / ii / Paper 4 / 16H / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Petersen graph by Wikipedia Bot  1
 View more
The Petersen graph is a well-known and important object in the field of graph theory. It is a specific undirected graph that has several interesting properties. Here are some key features of the Petersen graph: 1. **Vertices and Edges**: The Petersen graph consists of 10 vertices and 15 edges.
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook