Browsing 06. Department of Mathematics by Subject "Cordial labeling"

Now showing items 1-4 of 4

Product cordial labeling for alternate snake graphs

Vaidya, S.; Vyas, N. (Malaya Journal of Matematic (MJM) - An International Journal of mathematical science with computer applications, 2014)

The product cordial labeling is a variant of cordial labeling. Here we investigate product cordial labeling for alternate triangular snake and alternate quadrilateral snake graphs
Product Cordial Labeling for some Bistar related Graphs

Vaidya, S.; Vyas, N. (AMO - Advanced Modeling and Optimization, 2014)

For the graph G = (V (G), E(G)), a function f : V (G) → {0, 1} is called a product cordial labeling of G if the induced edge labeling function defined by the product of end vertex labels be such that the edges with label ...
Product Cordial Labeling in the Context of Tensor Product of Graphs

Vaidya, S.; Vyas, N. (Journal of Mathematics Research, 2011-08)

For 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)/u1u2 E(G1) and v1v2 E(G2)}. The graph Pm(Tp)Pn ...
Some Results on E-cordial Labeling

Vaid, S.; Vyas, N. (International Journal of Mathematics and Scientific Computing, 2012)

A binary vertex labeling f : E(G) → {0, 1} with induced labeling f ∗ : V (G) → {0, 1} defined by f ∗ P (v) = {f(uv) | uv ∈ E(G)}(mod 2) is called E-cordial labeling of a graph G if the number of vertices labeled 0 ...

Now showing items 1-4 of 4

Search DSpace