# A Study on Graph Theory of Path Graphs

## Main Article Content

## Abstract

In a simple graph the G is define as G = (V, E), here V is known as non-empty set of vertices and E is consider as edges. It is the set of unordered combination of unique elements of V. A simple graph has their points of confinement in demonstrating this present reality. Rather, we use multigraphs, which comprise of vertices and undirected edges between these vertices, with various edges between sets of vertices permitted. In this field of diagram hypothesis, a path graph or straight diagram is a graph whose vertices can be recorded in the request to such an extent that the edges are the place I = 1, 2, … , n ? 1. Proportionally, a way with in any event two vertices is associated and has two terminal (vertices that have degree 1), while all others (assuming any) have degree 2. The path graph of a diagram G is acquired by depicting the path in G by vertices and joining two vertices when the comparing path in G structure a path or a cycle The path graph of a graph G is obtained by describing the paths in G by vertices and joining two vertices when the corresponding paths in G form a path or a cycle

## Article Details

*International Journal on Future Revolution in Computer Science &Amp; Communication Engineering*,

*5*(8), 16–18. Retrieved from https://ijfrcsce.org/index.php/ijfrcsce/article/view/2006