Halin graph

Halin graph

In graph theory, a mathematical discipline, a Halin graph is a planar graph constructed from a plane embedding of a tree with at least 4 vertices and with no vertices of degree 2, by connecting all end vertices (i.e., the ones of degree 1) with a cycle in the natural cyclic order defined by the embedding of the tree."Encyclopaedia of Mathematics", first Supplementary volume, 1988, ISBN 0792347099, p. 281, article [http://books.google.com/books?id=3ndQH4mTzWQC&pg=PA281&dq=%22halin+graph%22+-wikipedia&ei=RgLsSKP2A5DetAPHydj2Bg&sig=ACfU3U3IK1TmaSTLW3yoIHaMUJvE3rKFIQ "Halin Graph"] , and references therein]

Properties

*It is an edge-minimal planar 3-connected graph.
*It has a unique planar embedding (up to the choice of the outer space; i.e., a unique embedding onto a 2-sphere).
*It is a Hamiltonian graph, moreover, it remains Hamiltonian after deletion of any vertex.

References


Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • Graph — 〈m. 16; Math.〉 = Graf2 * * * 1Graph , Graf , der; en, en [zu griech. gráphein = schreiben] (bes. Math., Naturwiss.): grafische Darstellung (z. B. von Relationen) in Form von [markierten] Knoten[punkten] u. verbindenden Linien (Kanten). 2Graph,… …   Universal-Lexikon

  • Outerplanar graph — A maximal outerplanar graph and its 3 coloring. In graph theory, an undirected graph is an outerplanar graph if it can be drawn in the plane without crossings in such a way that all of the vertices belong to the unbounded face of the drawing.… …   Wikipedia

  • Dual graph — G′ is the dual graph of G In mathematics, the dual graph of a given planar graph G is a graph which has a vertex for each plane region of G, and an edge for each edge in G joining two neighboring regions, for a certain embedding of G. The term… …   Wikipedia

  • Graphe planaire extérieur — Un graphe planaire extérieur maximal, muni d un 3 coloriage. En mathématiques, et plus particulièrement en théorie des graphes, un graphe non orienté est planaire extérieur (ou, par calque de l anglais, outer planar) s il peut être dessiné dans… …   Wikipédia en Français

  • List of mathematics articles (H) — NOTOC H H cobordism H derivative H index H infinity methods in control theory H relation H space H theorem H tree Haag s theorem Haagerup property Haaland equation Haar measure Haar wavelet Haboush s theorem Hackenbush Hadamard code Hadamard… …   Wikipedia

  • Tree decomposition — A graph with eight vertices, and a tree decomposition of it onto a tree with six nodes. Each graph edge connects two vertices that are listed together at some tree node, and each graph vertex is listed at the nodes of a contiguous subtree of the… …   Wikipedia

  • Cycle rank — In graph theory, the cycle rank of a directed graph is a digraph connectivity measure proposed first by Eggan and Büchi (Eggan 1963). Intuitively, this concept measures how close a digraph is to a directed acyclic graph (DAG), in the sense that a …   Wikipedia

  • therm- — therm(o) ♦ Élément, du gr. thermos « chaud », ou thermon « chaleur ». ⇒ therme. therm(o) , therme, thermie, thermique éléments, du gr. thermos, chaud , ou thermainein, chauffer …   Encyclopédie Universelle

  • thermo- — therm(o) ♦ Élément, du gr. thermos « chaud », ou thermon « chaleur ». ⇒ therme. therm(o) , therme, thermie, thermique éléments, du gr. thermos, chaud , ou thermainein, chauffer …   Encyclopédie Universelle

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”