Total Magic Cordial and Total Sequential Cordial Labeling of Path Related Graph
A graph is defined as G(V,E), with V being the vertex set and E denoting the edge set. A path graph is a simple graph with n number of vertices and n-1 number of edges, with vertices and edges denoted as v1,v2,…vn and edges marked as vivi+1. The cordial...
Read More
Square Difference Prime Labeling –More Results on Path Related Graphs
Vertices of the graph G are labeled with first p-1 whole numbers, where p is the number of vertices of the graph and edges are labeled with absolute difference of the squares of the labels of the end vertices. If the greatest common divisor of the labels of all...
Read More