Add to ORKGFor the graph G1 and G2 the tensor product is denoted by G1(Tp)G2 which is the graph with vertex set V(G1(Tp)G2) = V(G1) × V(G2) and edge set E(G1(Tp)G2) = {(u1, v1), (u2, v2)/u1u2E(G1) and v1v2E(G2)}. The graph Pm(Tp)Pn is disconnected for ∀m, n while the graphs Cm(Tp)Cn and Cm(Tp)Pn are disconnected for both m and n even. We prove that these graphs are product cordial graphs. In addition to this we show that the graphs obtained by joining the connected components of respective graphs by a path of arbitrary length also admit product cordial labeling
In this paper we work on the Bloom Torus graph by satisfying the condition of Smarandachely product...
A k-total edge product cordial labeling is a variant of the well-known cordial labeling. In this pap...
All graphs considered here are simple, finite, connected and undirected. We follow the basic notatio...
An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we c...
Let f be a map from V (G) to {0, 1, ..., k − 1} where k is an integer, 1 ≤ k ≤ |V (G)|. For each edg...
For a graph G = (V(G),E(G)) having no isolated vertex, a function ƒ : E(G)→{0;1} is called an edge p...
In this paper we prove that the join of two path graphs, two cycle graphs, Ladder graph and the tens...
Abstract: We prove that closed helm CHn, web graph Wbn, flower graph Fln, double triangular snake DT...
AbstractSuppose G = (V,E) is a graph with vertex set V and edge set E. A vertex labeling f : V → {0,...
We proved that Pn+1m is total product cordial. We also give sufficient conditions for the graph to a...
We prove that closed helm CHn, web graph Wbn, flower graph Fln, double triangular snake DTn and gear...
We present here product cordial labeling for thegraphs obtained by joining apex vertices of two star...
Let G = (V; E) be a graph and let f: V! f0; 1g be a mapping from the set of vertices to f0; 1g and f...
Abstract In this paper we introduce the k-Total Product cordial labelling of graphs. Also we investi...
A graph is said to be cordial if it has a 0-1 labeling that satisfies certain properties. In this pa...
In this paper we work on the Bloom Torus graph by satisfying the condition of Smarandachely product...
A k-total edge product cordial labeling is a variant of the well-known cordial labeling. In this pap...
All graphs considered here are simple, finite, connected and undirected. We follow the basic notatio...
An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we c...
Let f be a map from V (G) to {0, 1, ..., k − 1} where k is an integer, 1 ≤ k ≤ |V (G)|. For each edg...
For a graph G = (V(G),E(G)) having no isolated vertex, a function ƒ : E(G)→{0;1} is called an edge p...
In this paper we prove that the join of two path graphs, two cycle graphs, Ladder graph and the tens...
Abstract: We prove that closed helm CHn, web graph Wbn, flower graph Fln, double triangular snake DT...
AbstractSuppose G = (V,E) is a graph with vertex set V and edge set E. A vertex labeling f : V → {0,...
We proved that Pn+1m is total product cordial. We also give sufficient conditions for the graph to a...
We prove that closed helm CHn, web graph Wbn, flower graph Fln, double triangular snake DTn and gear...
We present here product cordial labeling for thegraphs obtained by joining apex vertices of two star...
Let G = (V; E) be a graph and let f: V! f0; 1g be a mapping from the set of vertices to f0; 1g and f...
Abstract In this paper we introduce the k-Total Product cordial labelling of graphs. Also we investi...
A graph is said to be cordial if it has a 0-1 labeling that satisfies certain properties. In this pa...
In this paper we work on the Bloom Torus graph by satisfying the condition of Smarandachely product...
A k-total edge product cordial labeling is a variant of the well-known cordial labeling. In this pap...
All graphs considered here are simple, finite, connected and undirected. We follow the basic notatio...