Path graph

From formulasearchengine
Jump to navigation Jump to search

{{#invoke:Hatnote|hatnote}} Template:Confused

Template:Infobox graph

In the mathematical field of graph theory, a path graph or linear graph is a particularly simple example of a tree, namely a tree with two or more vertices that is not branched at all, that is, contains only vertices of degree 2 and 1. In particular, it has two terminal vertices (vertices that have degree 1), while all others (if any) have degree 2.

Paths and cycles are fundamental concepts of graph theory, described in the introductory sections of most graph theory texts. See e.g. Bondy and Murty (1976), Gibbons (1985), or Diestel (2005).

See also


  • {{#invoke:citation/CS1|citation

|CitationClass=book }}

  • {{#invoke:citation/CS1|citation

|CitationClass=book }}

External links

cs:Cesta (graf) es:Camino (teoría de grafos) fr:Chaîne (graphe) he:מסלול (תורת הגרפים) ja:道 (グラフ理論) pl:Ścieżka (teoria grafów) pt:Caminho (teoria dos grafos) ru:Путь (теория графов) uk:Шлях (теорія графів) ur:رستہ (نظریہ مخطط) zh:道路 (图论)