About: Path graph     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:Unit108189659, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FPath_graph&invfp=IFP_OFF&sas=SAME_AS_OFF

In the mathematical field of graph theory, a path graph or linear graph is a graph whose vertices can be listed in the order v1, v2, …, vn such that the edges are {vi, vi+1} where i = 1, 2, …, n − 1. Equivalently, a path with at least two vertices is connected and has two terminal vertices (vertices that have degree 1), while all others (if any) have degree 2. Paths are fundamental concepts of graph theory, described in the introductory sections of most graph theory texts. See, for example, Bondy and Murty (1976), Gibbons (1985), or Diestel (2005).

AttributesValues
rdf:type
rdfs:label
  • Linearer Graph (de)
  • Grafo camino (es)
  • Graphe chemin (fr)
  • 경로 그래프 (ko)
  • Path graph (en)
  • Grafo caminho (pt)
  • Путь (теория графов) (ru)
  • Шлях (граф) (uk)
rdfs:comment
  • Ein linearer Graph oder Pfadgraph ist ein Graph, der nur aus einem Pfad besteht. Lineare Graphen sind einfache Beispiele für Bäume. Sie haben keine Verzweigungen, sodass die mittleren Knoten den Grad 2, und die Endknoten den Grad 1 haben. Der lineare Graph mit Knoten wird mit bezeichnet. (de)
  • En teoría de grafos, un grafo camino es un grafo cuyos vértices forman un camino. El camino de cualquier grafo es un subgrafo que da como resultado un grafo camino. (es)
  • En théorie des graphes, un graphe chemin ou graphe chaîne (en anglais path graph) est un arbre où chaque nœud est de degré au plus deux. (fr)
  • 그래프 이론에서 경로 그래프(經路graph, 영어: path graph)는 모든 꼭짓점의 차수가 2 이하인 나무이다. (ko)
  • Путь в графе — последовательность вершин, в которой каждая вершина соединена со следующей ребром. (ru)
  • No campo da matemática da teoria dos grafos, um grafo caminho ou grafo linear é um exemplo particularmente simples de uma árvore, ou seja, uma árvore com dois ou mais vértices que não tem ramificações, ou seja, contém somente vértices de grau 2 e 1. Em particular, ela tem dois vértices terminais (vértices que têm grau 1), enquanto todos os outros (se houver) têm grau 2. (pt)
  • In the mathematical field of graph theory, a path graph or linear graph is a graph whose vertices can be listed in the order v1, v2, …, vn such that the edges are {vi, vi+1} where i = 1, 2, …, n − 1. Equivalently, a path with at least two vertices is connected and has two terminal vertices (vertices that have degree 1), while all others (if any) have degree 2. Paths are fundamental concepts of graph theory, described in the introductory sections of most graph theory texts. See, for example, Bondy and Murty (1976), Gibbons (1985), or Diestel (2005). (en)
differentFrom
name
  • Path graph (en)
foaf:depiction
  • http://commons.wikimedia.org/wiki/Special:FilePath/Path-graph.svg
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
dbp:wikiPageUsesTemplate
thumbnail
automorphisms
chromatic index
chromatic number
image caption
  • A path graph on 6 vertices (en)
properties
title
  • Path Graph (en)
urlname
  • PathGraph (en)
has abstract
  • Ein linearer Graph oder Pfadgraph ist ein Graph, der nur aus einem Pfad besteht. Lineare Graphen sind einfache Beispiele für Bäume. Sie haben keine Verzweigungen, sodass die mittleren Knoten den Grad 2, und die Endknoten den Grad 1 haben. Der lineare Graph mit Knoten wird mit bezeichnet. (de)
  • En teoría de grafos, un grafo camino es un grafo cuyos vértices forman un camino. El camino de cualquier grafo es un subgrafo que da como resultado un grafo camino. (es)
  • In the mathematical field of graph theory, a path graph or linear graph is a graph whose vertices can be listed in the order v1, v2, …, vn such that the edges are {vi, vi+1} where i = 1, 2, …, n − 1. Equivalently, a path with at least two vertices is connected and has two terminal vertices (vertices that have degree 1), while all others (if any) have degree 2. Paths are often important in their role as subgraphs of other graphs, in which case they are called paths in that graph. A path is a particularly simple example of a tree, and in fact the paths are exactly the trees in which no vertex has degree 3 or more. A disjoint union of paths is called a linear forest. Paths are fundamental concepts of graph theory, described in the introductory sections of most graph theory texts. See, for example, Bondy and Murty (1976), Gibbons (1985), or Diestel (2005). (en)
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software