Publication date
May 2012
DOIAbstract
We prove that closed helm CHn, web graph Wbn, flower graph Fln, double triangular snake DTn and gear graph Gn admit product cordial labeling
We prove that closed helm CHn, web graph Wbn, flower graph Fln, double triangular snake DTn and gear graph Gn admit product cordial labeling
In this paper we prove that the join of two path graphs, two cycle graphs, Ladder graph and the tens...
In this paper we investigate the 4- remainder cordial behavior of grid, subdivision of crown, Subdiv...
All graphs considered here are simple, finite, connected and undirected. We follow the basic notatio...
Abstract: We prove that closed helm CHn, web graph Wbn, flower graph Fln, double triangular snake DT...
We proved that Pn+1m is total product cordial. We also give sufficient conditions for the graph to a...
We present here product cordial labeling for thegraphs obtained by joining apex vertices of two star...
In this paper we work on the Bloom Torus graph by satisfying the condition of Smarandachely product...
An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we c...
Abstract In this paper we introduce the k-Total Product cordial labelling of graphs. Also we investi...
For a graph G = (V(G),E(G)) having no isolated vertex, a function ƒ : E(G)→{0;1} is called an edge p...
For the graph G1 and G2 the tensor product is denoted by G1(Tp)G2 which is the graph with vertex set...
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...
This paper deals with study of the product cordial labeling of graphs that are obtained by applying ...
In this paper the researcher prepares truth table for the labeling of Bloom Torus graph by admitting...
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 prove that the join of two path graphs, two cycle graphs, Ladder graph and the tens...
In this paper we investigate the 4- remainder cordial behavior of grid, subdivision of crown, Subdiv...
All graphs considered here are simple, finite, connected and undirected. We follow the basic notatio...
Abstract: We prove that closed helm CHn, web graph Wbn, flower graph Fln, double triangular snake DT...
We proved that Pn+1m is total product cordial. We also give sufficient conditions for the graph to a...
We present here product cordial labeling for thegraphs obtained by joining apex vertices of two star...
In this paper we work on the Bloom Torus graph by satisfying the condition of Smarandachely product...
An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we c...
Abstract In this paper we introduce the k-Total Product cordial labelling of graphs. Also we investi...
For a graph G = (V(G),E(G)) having no isolated vertex, a function ƒ : E(G)→{0;1} is called an edge p...
For the graph G1 and G2 the tensor product is denoted by G1(Tp)G2 which is the graph with vertex set...
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...
This paper deals with study of the product cordial labeling of graphs that are obtained by applying ...
In this paper the researcher prepares truth table for the labeling of Bloom Torus graph by admitting...
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 prove that the join of two path graphs, two cycle graphs, Ladder graph and the tens...
In this paper we investigate the 4- remainder cordial behavior of grid, subdivision of crown, Subdiv...
All graphs considered here are simple, finite, connected and undirected. We follow the basic notatio...
Add to ORKG