Editorial Open Access

THE GRAPHIC FACTORS

Abstract

A graph G is made up of a non-null set V of items called vertices and a set E of objects called edges, with no common element between the two sets. Only two vertices, referred to as the edge's ends, are associated with each edge. The identical pair of ends can be found on two or more edges. If both F and E are finite, G is finite; otherwise, it is infinite. The number of edges of G that have an as an end is the degree dGa) of a vertex a. If the degree of each vertex of G is finite, G is locally finite. As a result, the finite graphs are included as special cases in the locally finite graphs.A paragraph within a paragraph G has a graph called H of G. That is, H's vertices and edges are G's vertices and edges, and a H edge has the same ends in both H and G. A limitation of G is a subgraph that contains all of G's vertices.

Jeninfer Gomez