Edge cordial and total edge cordial labeling for eight sprocket graph (original) (raw)
Related papers
Prime Cordial Labeling for Eight Sprocket Graph
International Journal of Mathematics Trends and Technology, 2021
This papers deals with prime cordial labeling of newly introduced eight sprocket graph. This graph is already proven as cordial, Edge cordial and gracious in graph labelling. In our study we have further proved that Eight Sprocket graph related families of connected are Prime cordial graphs. Also the path union of Eight Sprocket graph, cycle of Eight Sprocket graph and star of Eight Sprocket graph are holds well with prime-cordial.
Some new standard graphs labeled by 3-total edge product cordial labeling
Applied Mathematics and Nonlinear Sciences, 2017
In this paper, we study 3–total edge product cordial (3–TEPC) labeling which is a variant of edge product cordial labeling. We discuss Web, Helm, Ladder and Gear graphs in this context of 3–TEPC labeling. We also discuss 3–TEPC labeling of some particular examples with corona graph.
7-CORDIAL Labeling of Standard Graphs
International Journal of Applied Mathematical Research, 2014
We contribute here some standard results for 7-cordial labeling. It has been proved that fans, friendship graphs, ladders, double fans, double wheels admit 7-cordial labeling.
Edge product cordial labeling of some graphs
Journal of Applied Mathematics and Computational Mechanics, 2019
For a graph G = (V (G), E(G)) having no isolated vertex, a function f : E(G) → {0, 1} is called an edge product cordial labeling of graph G, if the induced vertex labeling function defined by the product of labels of incident edges to each vertex be such that the number of edges with label 0 and the number of edges with label 1 differ by at the most 1 and the number of vertices with label 0 and the number of vertices with label 1 also differ by at the most 1. In this paper we discuss the edge product cordial labeling of the graphs W (t) n , PS n and DPS n .
3-Total Edge Sum Cordial Labeling for Some Graphs
International Journal of Computer Applications, 2015
The sum cordial labeling is a variant of cordial labeling. Here a variant of 3-total sum cordial labeling was introduced and name it as 3-total edge sum cordial labeling unlike in 3-total sum cordial labeling the roles of vertices and edges are interchanged. Here in this paper path graph, cycle graph and complete bipartite graph k 1 , n are investigated on this newly defined concept.
Face Integer Cordial Labeling of Graphs
In this paper, we have introduced and investigated the face integer cordial labeling of wheel W n , fan f n , triangular snake T n , double triangular snake DT n , star of cycle C n and DS(B n,n). Keywords-Integer cordial labeling, face integer cordial labeling, face integer cordial graph.
3-TOTAL Edge Mean Cordial Labeling of Some Standard Graphs
Open Journal of Mathematical Sciences, 2019
In this paper, we introduce new labeling and named it as k-total edge mean cordial (k-TEMC) labeling. We study certain classes of graphs namely path, double comb, ladder and fan in the context of 3-TEMC labeling.
Sum cordial labeling of graphs
Journal of Mathematical and Computational Science, 2014
In this paper, we investigate the sum cordial labeling of flower graph, web graph, tadpole, triangular snake and shell graph.
2019
Let G={V,E} be a graph. A mapping f : V(G)→{0,1} is called Binary Vertex Labeling. A Binary Vertex Labeling of a graph G is called a Cordial Labeling if |v_f (0)-v_f (1)|≤1 and |e_f (0)-e_f (1)|≤1. A graph G is Cordial if it admits Cordial Labeling. Here, we prove that Sunlet graph (S_n) and Shell graph C_((n,n-3)) are Cordial and the Splitting graphs of them are also Cordial.
Integer Cordial Labeling for Certain Families of Graphs
Advances in Mathematics: Scientific Journal
An integer cordial labeling of a graph G(p, q) is an injective map f : V → [− p 2 ... p 2 ] * or [− p 2 ... p 2 ] as p is even or odd, which induces an edge labeling f * : E → {0, 1} defined by f * (uv) = 1, f (u) + f (v) ≥ 0 0, otherwise such that the number of edges labeled with 1 and the number of edges labeled with 0 differ at most by 1. If a graph has integer cordial labeling, then it is called an integer cordial graph. In this paper, we have proved that the Sierpinski Sieve graph, the graph obtained by joining two friendship graphs by a path of arbitrary length, (n, k)kite graph and Prism graph admits integer cordial labeling.