Chirag Barasara

• Doctor of Philosophy
• Professor (Assistant) at Hemchandracharya North Gujarat University

A graph with q edges is called antimagic if its edges can be labeled with 1, 2, 3, ..., q without repetition such that the sums of the labels of the edges incident to each vertex are distinct. In this paper we study antimagic labeling of double triangular snake, alternate triangular snake, double alternate triangular snake, quadrilateral snake, dou...

A power cordial labeling of a graph G=(V (G), E (G)) is a bijection f: V (G)→{1, 2,...,| V (G)|} such that an edge e= uv is assigned the label 1 if f (u)=(f (v)) n or f (v)=(f (u)) n, for some n∈ ℕ∪{0}{0} and the label 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. In this paper, we...

For a graph G = (V(G), E(G)), the vertex labeling function is defined as a bijection f:V(G)-> {1, 2, ..., |V(G)|} such that an edge uv is assigned the label 1 if f(u) or f(v) divides the other and 0 otherwise. f is called divisor cordial labeling of graph G if the number of edges labeled with 0 and the number of edges labeled with 1 differ by at mo...

A graph with q edges is called antimagic if its edges can be labeled with 1, 2, 3, ..., q without repetition such that the sums of the labels of the edges incident to each vertex are distinct. As Wang et al. [2012], proved that not all graphs are antimagic, it is interesting to investigate antimagic labeling of graph families. In this paper we disc...

A power cordial labeling of a graph G = V G , E G is a bijection f : V G ⟶ 1,2 , … , V G such that an edge e = u v is assigned the label 1 if f u = f v n or f v = f u n , for some n ∈ N ∪ 0 and the label 0 otherwise, and satisfy the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. The graph that admits powe...

For a graph G = (V (G),E(G)), the vertex labeling function is defined as a bijection f : V (G) → {1, 2, . . . , |V (G)|} such that an edge uv is assigned the label 1 if one f(u) or f(v) divides the other and 0 otherwise. f is called divisor cordial labeling of graph G if the number of edges labeled with 0 and the number of edges labeled with 1 diff...

A power cordial labeling of a graph G = (V(G),E(G)) is a bijection f:V(G) → {1, 2, ..., |V(G)|} such that an edge e = uv is assigned the label 1 if f(u)=(f(v))^n or f(v)=(f(u))^n, For some n∈N∪{0} and the label 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. In this paper, we investig...

In 1987, Cahit [7] introduced cordial labeling as a weaker version of graceful labeling and harmonious labeling. In 2011, Varatharajan et al. [16] have introduced divisor cordial labeling as a variant of cordial labeling. In this paper, we investigate divisor cordial labeling for C n-quadrilateral snake, degree splitting graph of triangular snake,...

In 1967, Rosa [5] introduced -valuation labeling of a graph. Golomb [20] subsequently called such labeling as a graceful labeling. In 1980, Graham and Sloane [15] introduced harmonious labeling. In 1987, Cahit [8] introduced cordial labeling as a weaker version of graceful labeling and harmonious labeling. In 2011, Varatharajan et al. [16] have in...

In 1987, Cahit [4] introduced cordial labeling as a weaker version of graceful labeling and harmonious labeling. In 2011, Varatharajan et al.[8] have introduced divisor cordial labeling as a variant of cordial labeling. In this paper, we investigate divisor cordial labeling for comb graph, square graph of path, square graph of cycle, middle graph o...

The line graph L(G) of a graph G is the graph whose vertex set is E(G) and two vertices are adjacent in L(G) whenever they are incident in G. In this paper we have investigated product cordial labeling of line graph of some product cordial graphs.

The product cordial labeling is a variant of cordial labeling. We introduce a variant of product cordial labeling and name it as edge product cordial labeling. Unlike in product cordial labeling the roles of vertices and edges are interchanged. We investigate several results on this newly defined concept.

An edge product cordial labeling is a variant of product cordial labeling. We have explored this concept in the context of different graph products.

The total product cordial labeling is a variant of cordial labeling. We introduce an edge analogue product cordial labeling as a variant of total product cordial labeling and name it as total edge product cordial labeling. Unlike to total product cordial labeling the roles of vertices and edges are interchanged in total edge product cordial labelin...

For a graph G=(V(G), E(G)), an edge labeling function f:E(G)→{0,1} induces a vertex labeling function f*:V(G)→{0,1} such that f*(v) is the product of the labels of the edges incident to v . This function f is called edge product cordial labeling of G if the edges with label 1 and label 0 differ by at most 1 and the vertices with label 1 & label 0 a...

The total edge product cordial labeling is a variant of cordial labeling in general and total product cordial labeling in particular. Here we investigate total edge product cordial labeling of some cycle and path related graphs.

For a graph G = (V (G),E(G)) a function f :E(G) -> {0, 1} is called an edge product cordial labeling of G if the induced vertex labeling function defined by the product of incident edge labels be such that the edges with label 1 & label 0 differ by at most 1 and the vertices with label 1 & label 0 also differ by at most 1. We investigate edge produ...

We prove that closed helm CH n , web graph Wb n , flower graph Fl n , double triangular snake DT n and gear graph G n admit product cordial labeling.

The product cordial labeling is a variant of cordial labeling. We introduce a variant of product cordial labeling and name it as edge product cordial labeling. Unlike in product cordial labeling the roles of vertices and edges are interchanged. We investigate several results on this newly defined concept.

The geometric mean labeling is a variation of arithmetic mean labeling. We investigate geometric mean labeling for various graphs resulted from the duplication of graph elements.

The harmonic mean labeling is a variation of arithmetic mean labeling. We investigate harmonic mean labeling for various graphs resulted from the duplication of graph elements.

We investigate product cordial labeling for some new graphs. We prove that the friendship graph, cycle with one chord (except when n is even and the chord joining the vertices at diameter distance), cycle with twin chords (except when n is even and one of the chord joining the vertices at diameter distance) are product cordial graphs. We also inves...

In this paper we prove that the graphs obtained by duplication of an edge in Cn, Mutual duplication of pair of edges and mutual duplication of pair of vertices between two copies of cycle Cn admit product cordial labeling. Moreover let G and G' be two graphs such that their order and/or size differ by at most 1 then we prove that the new graph obta...

In the present investigations we prove that the shadow graphs as well as the middle graphs of cycle n C and path n P are 3-equitable graphs.