OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

McLaughlin graph

 Home Mathematics Fields of mathematics Algebra Algebraic graph theory Regular graphs
 0 By others on same topic  0 Discussions  1970-01-01  See my version
The McLaughlin graph is a particular type of graph in the field of graph theory. It is an undirected graph that has some interesting properties and is often studied in relation to cliques, colorings, and various other graph properties. Here are some key characteristics of the McLaughlin graph: 1. **Vertices and Edges**: The McLaughlin graph has 12 vertices and 30 edges.

 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