OurBigBook About$ Donate
 Sign in Sign up

McKay–Miller–Širáň graph

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Algebra Algebraic graph theory Regular graphs
 0 By others on same topic  0 Discussions Create my own version
The McKay–Miller–Širáň graph is a notable bipartite graph that is specifically defined for its unique properties. It is a strongly regular graph, characterized as a (0, 1)-matrix representation. Key properties of this graph include: 1. **Vertex Count**: It has a total of 50 vertices. 2. **Regularity**: Each vertex connects to exactly 22 other vertices.

 Ancestors (6)

  1. Regular graphs
  2. Algebraic graph theory
  3. Algebra
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

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
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook