OurBigBook About$ Donate
 Sign in Sign up

Bouquet graph (Bj​)

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Graph theory Graph Multigraph
2026-10-14  0 By others on same topic  0 Discussions Create my own version
A bouquet graph consists of one vertex and j self-loops. Its vertex has degree 2j, and its graph excess is j−1. The two-loop bouquet is one of the three possible kernels of a bicyclic graph; in a simple subdivision, each loop must expand to a cycle of length at least three.

 Ancestors (7)

  1. Multigraph
  2. Graph
  3. Graph theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (2)

  • Bicyclic kernel classification
  • Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 12 / 4 / ii / Solution

 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