Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Path_graph> ?p ?o. }
Showing items 1 to 44 of
44
with 100 items per page.
- Path_graph abstract "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).".
- Path_graph thumbnail Path-graph.svg?width=300.
- Path_graph wikiPageExternalLink gtwa.html.
- Path_graph wikiPageExternalLink graph.theory.
- Path_graph wikiPageID "4587190".
- Path_graph wikiPageRevisionID "604135403".
- Path_graph automorphisms "2".
- Path_graph chromaticIndex "2".
- Path_graph chromaticNumber "2".
- Path_graph diameter "n - 1".
- Path_graph edges "n - 1".
- Path_graph hasPhotoCollection Path_graph.
- Path_graph imageCaption "A path graph on 6 vertices".
- Path_graph name "Path graph".
- Path_graph properties Bipartite_graph.
- Path_graph properties Tree_(graph_theory).
- Path_graph properties Unit_distance_graph.
- Path_graph radius "⌊n/2⌋".
- Path_graph spectrum "{2 cos1; k=1,...,n}".
- Path_graph title "Path Graph".
- Path_graph urlname "PathGraph".
- Path_graph vertices "n".
- Path_graph subject Category:Graph_theory_objects.
- Path_graph subject Category:Parametric_families_of_graphs.
- Path_graph subject Category:Trees_(graph_theory).
- Path_graph type Abstraction100002137.
- Path_graph type Communication100033020.
- Path_graph type Graph107000195.
- Path_graph type VisualCommunication106873252.
- Path_graph comment "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.".
- Path_graph label "Grafo caminho".
- Path_graph label "Graphe chemin".
- Path_graph label "Linearer Graph".
- Path_graph label "Path graph".
- Path_graph sameAs Linearer_Graph.
- Path_graph sameAs Graphe_chemin.
- Path_graph sameAs Grafo_caminho.
- Path_graph sameAs m.03x_gl9.
- Path_graph sameAs Q917421.
- Path_graph sameAs Q917421.
- Path_graph sameAs Path_graph.
- Path_graph wasDerivedFrom Path_graph?oldid=604135403.
- Path_graph depiction Path-graph.svg.
- Path_graph isPrimaryTopicOf Path_graph.
