• No results found

Total Product Cordial Labeling

Further Results on Divisor Cordial Labeling

Further Results on Divisor Cordial Labeling

... many labeling schemes are also introduced with minor variations in cordial ...The product cordial labeling, total product cordial labeling and prime ...

10

Vol 3, No 5 (2012)

Vol 3, No 5 (2012)

... k- Total Product cordial labeling of G if f ( ) i − f ( j ) â‰Ī 1 , i,j ∈ ...the total number of vertices and edges labelled with ...k- Total Product cordial ...

6

Some More Results On Total Neighbourhood Cordial And Total Neighbourhood Product Cordial Labeling Of Graphs

Some More Results On Total Neighbourhood Cordial And Total Neighbourhood Product Cordial Labeling Of Graphs

... graph labeling, we refer to Gallian [2]. The concept of cordial labeling of a graph was introduced by Cahit ...of product cordial labeling of a graph. The concept of total ...

8

Face And Total Face Product Cordial Labeling Of Graphs

Face And Total Face Product Cordial Labeling Of Graphs

... A total product cordial labeling of a graph G with vertex set V is a function f from V to {0, 1} such that if each edge uv is assigned a label f(u) f(v), the number of vertices and edges ...

10

Total edge product cordial labeling of graphs

Total edge product cordial labeling of graphs

... The total product cordial labeling is a variant of cordial ...analogue product cordial labeling as a variant of total product cordial ...

9

Vol 6, No 10 (2015)

Vol 6, No 10 (2015)

... k-Total product cordial labeling of G if |𝑓𝑓(𝑖𝑖) − 𝑓𝑓(𝑗𝑗)|â‰Ī1 ,i,j ∈ ...the total number of vertices and edges labeled with x ( ...k-total product cordial ...

5

Further Results on Prime Cordial Labeling

Further Results on Prime Cordial Labeling

... vertex labeling is labeling of vertices with either 0 or ...of cordial labeling was introduced by Cahit [1]. In cordial labeling, each edge e = uv in E(G) is assigned by |f(u) – ...

8

$k$-Total prime cordial labeling of graphs

$k$-Total prime cordial labeling of graphs

... k-total product cordial graph and studied certain graphs for this ...prime cordial labeling of ...k- total prime cordial graphs and investigate 4-total prime ...

7

Some New Face And Total Face Signed Product Cordial Graphs

Some New Face And Total Face Signed Product Cordial Graphs

... graph labeling, we refer to Gallian [3]. The concept of cordial labeling of graph was introduced by Cahit ...signed product cordial labeling of ...and total face signed ...

9

Signed and Signed Product Cordial Labeling of Cylinder Graphs and Banana Tree

Signed and Signed Product Cordial Labeling of Cylinder Graphs and Banana Tree

... signed product cordial labeling was introduced by Baskar Babujee ...signed product cordial. They have also proved that every signed product cordial labeling is a ...

8

Edge Natural Product Cordial ( enpc) Labeling: A new Graph Labeling Method

Edge Natural Product Cordial ( enpc) Labeling: A new Graph Labeling Method

... case 2 : Multiplication of two odd numbers only can produce an odd number. Therefore we cannot label an edge with even number which is adjacent at both ends with edges of odd label number. As a result we have to label ...

5

Vol 7, No 11 (2016)

Vol 7, No 11 (2016)

... graph labeling was introduced by Rosa [2] in 1967. Graph labeling is an assignment of integers to the vertices or edges or both subject to certain ...graph labeling, various labeling of graphs ...

6

On Signed Product Cordial Labeling

On Signed Product Cordial Labeling

... The total number of vertices labeled with –1’s are given by v f ( 1)  ï€― ï€Ļ n  1 2 ï€Đ and the total number of vertices labeled with 1’s are given by v f (1) ï€― ï€Ļ n ï€Ŧ 1 2 ï€Đ ...the total difference ...

6

PRODUCT CORDIAL LABELING OF DOUBLE PATH UNION OF C3 RELATED GRAPHS

PRODUCT CORDIAL LABELING OF DOUBLE PATH UNION OF C3 RELATED GRAPHS

... of labeling so ...Graph labeling by ...the total graph of Pn (the total graph of Pn has vertex set V (Pn)∊E(Pn) with two vertices adjacent whenever they are neighbors in Pn); Cn if and only if ...

7

Neighbourhood Edge Product Cordial And Total Neighbourhood Edge Product Cordial Labeling Of Graphs

Neighbourhood Edge Product Cordial And Total Neighbourhood Edge Product Cordial Labeling Of Graphs

... edge product cordial graph G and one of the component is path, then 01 - type edge labeling on path, induces each non pendent vertex label as 0 and pendent vertex label as either 0 or ...edge ...

8

Further Results on Sum Cordial Graphs

Further Results on Sum Cordial Graphs

... All graphs G = ( V ( G ) , E ( G )) in this paper are finite, connected and undirected. For any undefined nota- tions and terminology we follow [3]. If the vertices or edges or both of the graph are assigned valued ...

7

$4$-Total prime cordial labeling of some cycle related graphs

$4$-Total prime cordial labeling of some cycle related graphs

... cordial labeling behaviour of path, cycle, star, bistar, some complete graphs, comb, double comb, triangular snake, double triangular snake, ladder, friendship graph, flower graph, gear graph, Jelly fish, ...

9

Some families of 4-total difference cordial graphs

Some families of 4-total difference cordial graphs

... k- total difference cordial graph was introduced in ...difference cordial labeling behaviour of path, complete graph, comb, armed crown, crown, wheel, star etc have been in- vestigated and ...

7

$k$-Total difference cordial graphs

$k$-Total difference cordial graphs

... of cordial labeling of graphs. The cocept of k-difference cordial graph was introduced in [4] ...prime cordial graph . Motivated by this, we introduce k-total difference cordial ...

8

Remainder Cordial Labeling of Graphs

Remainder Cordial Labeling of Graphs

... In this paper we introduce remainder cordial labeling of graphs. Let G be a (p, q) graph. Let f : V (G) → {1, 2, ..., p} be a 1 − 1 map. For each edge uv assign the label r where r is the remainder when ...

14

Show all 10000 documents...

Related subjects