Category:Parametric families of graphs

This category is for the families of graphs whose definitions depend on a set of numeric parameters.

Pages in category "Parametric families of graphs"

The following 53 pages are in this category, out of 53 total.

Next items are not visible in browsers without Javascript

A

  • Andrásfai graph
  • Arrangement graph

B

  • Book (graph theory)
  • Bouquet graph

C

  • Circular coloring
  • Complete bipartite graph
  • Complete graph
  • Crown graph
  • Cube-connected cycles
  • Cycle graph

D

  • De Bruijn graph
  • Dipole graph

F

  • Fan graph
  • Fibonacci cube
  • Flower snark
  • Folded cube graph
  • Frankl–Rödl graph
  • Friendship graph

G

  • Generalized Petersen graph
  • Grassmann graph

H

  • Half graph
  • Halved cube graph
  • Hamming graph
  • Hanoi graph
  • Hedgehog (hypergraph)
  • Henson graph
  • Hypercube graph

J

  • Johnson graph

K

  • Kautz graph
  • Keller's conjecture
  • King's graph
  • Kneser graph
  • Knight's graph

L

  • Ladder graph
  • Lollipop graph

M

  • McKay–Miller–Širáň graph
  • Möbius ladder

N

  • Nested triangles graph

O

  • Odd graph

P

  • Paley graph
  • Pancake graph
  • Path graph

Q

  • Queen's graph

R

  • Rook's graph

S

  • Shannon multigraph
  • Shuffle-exchange network
  • Sierpiński graph
  • Star (graph theory)
  • Sudoku graph

T

  • Tadpole graph
  • Turán graph

W

  • Wheel graph
  • Windmill graph
Next items are not visible in browsers without Javascript

This category content has been reduced to only pages contained in the ZIM file.

Category:
  • Graph families
This page is issued from Wikipedia. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.