Path graph
graph with nodes connected linearly
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 of 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).
As Dynkin diagrams
In algebra, path graphs appear as the Dynkin diagrams of type A. As such, they classify the root system of type A and the Weyl group of type A, which is the symmetric group.
See also
Path (graph theory)
Ladder graph
Caterpillar tree
Complete graph
Null graph
Path decomposition
Cycle (graph theory)
References
Bondy, J. A.; Murty, U. S. R. (1976). Graph Theory with Applications.
This brief starts where responsible research should: with the source description of “Path graph” as graph with nodes connected linearly. Everything that follows is an evidence route, not borrowed authority.
Why this record matters
The subject matters to the general reference register because the source frames it as graph with nodes connected linearly. Its deeper value depends on whether names, dates, institutions and citations support that framing.
Vocabulary and entity names are the principal evidence signals here, because they determine the precision of every later search. The source revision retrieved here is dated Nov 15, 2024. The linked authority identifier is Q917421. None of the 0 selected statements returned an explicit reference. The first chronological checks are 1976, 1985 and 2005.
The absence of detail may reflect summary conventions rather than a lack of surviving documentation. The lead is largely declarative, so disagreement and counter-evidence require a deliberate search beyond the opening account. Authority statements aid reconciliation but still require their own references, qualifiers and ranks to be checked.
How to read it
Use the entry as an orientation point, then follow its citations and revision history. Names, dates and institutional relationships should be checked against the original record.
- Subject orientation
- Search vocabulary
- Locating named sources
The closest primary source, responsible institution and strongest cited specialist reference.
Three-step research path
- Establish the record: confirm the title “Path graph”, its source revision and the description used here.
- Expand the search: follow Path graph primary sources, Path graph archive and Path research across catalogues and specialist indexes.
- Test the account: compare the strongest cited source with the responsible institution’s current record and note any disagreement.
Questions for further research
- Which source most directly establishes the central claim about “Path graph”?
- Which cited source is closest to the event, object or claim?
- What terminology or title could unlock a more precise catalogue search?
Search terms from this dossier
This entry incorporates text from “Path graph” on English Wikipedia. Contributors are listed in the page history. Text is available under the Creative Commons Attribution-ShareAlike 4.0 License. Selected authority identifiers and statements are retrieved from Wikidata under CC0; their references and qualifiers remain part of the verification path.