TOTAL MAGIC CORDIAL LABELING OF PATH GRAPH
Versandkostenfrei!
Versandfertig in 6-10 Tagen
33,99 €
inkl. MwSt.
PAYBACK Punkte
17 °P sammeln!
A graph is identified as G (V, E) with V as the vertex set (which is nonempty) and E as the edge set (which may be empty). Vertex set is a collection of vertices (dots or points), edge set represents a collection of edges (lines or arcs) joining certain pair of these vertices. When there is no concern about the direction of an edge the graph is called undirected. The unordered pair of vertices are joined by a line for the undirected graph and ordered pair of vertices for the directed graph. A graph labeling is defined as the set of integers assigned to the graph elements such as vertices and e...
A graph is identified as G (V, E) with V as the vertex set (which is nonempty) and E as the edge set (which may be empty). Vertex set is a collection of vertices (dots or points), edge set represents a collection of edges (lines or arcs) joining certain pair of these vertices. When there is no concern about the direction of an edge the graph is called undirected. The unordered pair of vertices are joined by a line for the undirected graph and ordered pair of vertices for the directed graph. A graph labeling is defined as the set of integers assigned to the graph elements such as vertices and edges on some basic conditions. For the past 50 years so far vast literature has grown around the subject. Cahit has introduced Total Magic cordial labeling and Total sequential cordial labeling for undirected graph.In my research I found the total magic cordial labeling of Path related graph and extended the same labeling for directed graph and proved the same for Paley Digraph.
Andere Kunden interessierten sich für
