Bouquet graph: Difference between revisions - Wikipedia

Line 1:

[[File:Topological Rose.png|thumb|upright=0.8|<math>B_4</math>, a bouquet with one vertex and four self-loop edges]]

In mathematics, a '''bouquet graph''' <math>B_m</math>, for an integer parameter <math>m</math>, is an [[undirected graph]] with one [[Vertex (graph theory)|vertex]] and <math>m</math> edges, all of which are [[self-loop]]s. It is the [[graph theory|graph-theoretic]] analogue of the [[Rose (topology)|topological bouquetrose]], a space of <math>m</math> circles joined at a point. When the context of graph theory is clear, it can be called more simply a '''bouquet'''.{{r|bw}}

[[File:Self-trial ribbon graph.svg|thumb|upright=1.1|[[Ribbon graph]] representation of an embedding of <math>B_3</math> onto the [[projective plane]].]]