product cordial
Some More Results On Total Neighbourhood Cordial And Total Neighbourhood Product Cordial Labeling Of Graphs
... neighbourhood product cordial labeling of G, if for every vertex v ∈ V(G), then all the vertices adjacent to the vertex v have the same label and | f(0) – f(1)| ≤ 1, where f(i) denotes sum of the number of ...
8
Wheel Related Some Signed Product Cordial Graphs
... signed product cordial labeling of gear graph, flower graph, sunflower graph, cobweb graph and lotus inside a ...signed product cordial ...signed product cordial ...
7
PRODUCT CORDIAL LABELING OF DOUBLE PATH UNION OF C3 RELATED GRAPHS
... of cordial labeling [5]. There are variety of cordial labeling available in labeling of ...of product cordial labeling. A product cordial labeling of a graph G with vertex set V ...
7
Product Cordial Graph in the Context of Some Graph Operations on Gear Graph
... on product cordial labeling of some graphs obtained by duplication of some graph elements in gear ...on product cordial labeling of some graphs obtained by switching of a vertex of different ...
9
A Note On Product Cordial Invariance Of Fusion Graphs
... Product cordial labeling was introduced by Somsundaran and others[9].Let Gbe a (p,q) graph.Define a function f: V(G) {0,1}.This distribution of binary digits on vertices should be such that when for any ...
7
Total edge product cordial labeling of graphs
... total product cordial labeling is a variant of cordial ...analogue product cordial labeling as a variant of total product cordial labeling and name it as total edge ...
9
Product cordial labeling for alternate snake graphs
... is product cordial then q < p 2 4 −1 + ...are product cordial while Vaidya and Kanani[6] have reported the product cor- dial labeling for some cycle related graphs and investigated ...
9
Results on Cycle related product cordial graph A . NELLAI MURUGAN 1and A. MEENAKSHI SUNDARI2
... Let G = (V,E) be a graph with p vertices and q edges. A Product cordial labeling of a Graph G with vertex set V is a bijection from V to {0,1} such that if each edge uv is assigned the label ( f(u) . f(v) ) ...
6
Product Cordial Labeling of Some Cycle Related Graphs
... The product cordial labeling was introduced by Sundaram et ...is product cordial then q < (p2 − 1)/4 ...are product cordial is proved in Vaidya and Dani[4] while the ...
5
Edge Product Cordial Labeling of Some Cycle Related Graphs
... edge product cordial labeling of graph G, if the induced vertex labeling function defined by the product of labels of incident edges to each vertex is such that the number of edges with label 0 and ...
12
Some Complete- Graph Related Families Of Product Cordial (pc) Graphs.
... of product cordial labelings. A product cordial labeling of a graph G with vertex set V is a function f :V {0,1} such that if each edge uv is assigned the label f(u)f(v), the number of ...
8
Some New Face And Total Face Signed Product Cordial Graphs
... of cordial labeling of graph was introduced by Cahit ...signed product cordial labeling of ...signed product cordial labeling of graph and they proved the graphs Pl n , n ≥ 5 and Pl m,n ...
9
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 product ...
8
Face And Total Face Product Cordial Labeling Of Graphs
... of cordial labeling of graph. The concept of product cordial labeling of a graph was introduced by Sundaram ...total product cordial labeling of graph. The concept of signed ...
10
Fibonacci Product Cordial Labelling of some Graphs
... Fibonacci cordial labeling have been introduce by ...Fibonacci product cordial labeling have introduced by Tessymol Abraham and Shiny Jose ...
6
On Signed Product Cordial Labeling
... f u f v , the number of vertices la- beled with 0 and the number of vertices labeled with 1 differ by at most 1, and the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph ...
6
Near Product Cordial Graph Cycle
... If the labeling in the graph satisfies the condition of Near product cordial then it is called Near product cordial graphs.In this paper we have proved that the above mentioned graphs ex[r] ...
5
Signed Product Cordial of the Sum and Union of Two Fourth Power of Paths and Cycles
... signed product cordial if it admits ±1 labeling that satisfies certain conditions ...signed product cordial labeling and present necessary and sufficient conditions for signed product ...
6
Some Edge Product Cordial Graphs in the Context of Duplication of Some Graph Elements
... graph G admits edge product cordial labeling. Thus, G is edge product cordial graph. □ Illustration 5. The graph obtained by duplication of each vertex of degree three by an edge in a gear ...
11
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 total signed ...
8