# A Study on Graph Theory of Path Graphs

## Abstract

A simple graph G = (V, E) consists of V , a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges. Simple graphs have their limits in modeling the real world. Instead, we use multigraphs, which consist of vertices and undirected edges between these vertices, with multiple edges between pairs of vertices allowed. 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.

## Article Details

How to Cite
B. Senthilkumar , M., & Jayafranglin , M. (2018). A Study on Graph Theory of Path Graphs. International Journal on Future Revolution in Computer Science &Amp; Communication Engineering, 4(8), 28 –. Retrieved from https://ijfrcsce.org/index.php/ijfrcsce/article/view/1717
Section
Articles