• No results found

Cordial graphs

$k$-Total difference cordial graphs

$k$-Total difference cordial graphs

... difference cordial la- beling is called a k-total difference cordial ...difference cordial labeling of some graphs and study the 3-total difference cordial labeling behaviour of ...

8

Path Related Homo-Cordial Graphs

Path Related Homo-Cordial Graphs

... 9. A.Nellai Murugan and P.Iyadurai Selvaraj, Cycle and Armed Cup cordial graphs, International Journal of Innovative Science, Engineering & Technology , ISSN 2348-7968,Vol.I, Issue 5 ,July. 2014,PP ...

5

On Z 2 x Z 2 - Cordial Graphs

On Z 2 x Z 2 - Cordial Graphs

... - cordial if there is a labeling f of V (G ) with elements of A so that for all a , b  A , the edge ab is labeled with f ( a )  f ( b ) then the number of vertices labeled with a and the vertices labeled with b ...

5

Several result on SD-prime cordial graphs

Several result on SD-prime cordial graphs

... SD-prime cordial graphs were discussed in [6, 7, 8, ...zero-divisor graphs of commutative ring was introduced by ...zero-divisor graphs of commutative ...zero-divisor graphs of ...

7

Further Results on Sum Cordial Graphs

Further Results on Sum Cordial Graphs

... of cordial labeling was introduced by Cahit [2] in which he investigated several results on this newly defined ...new graphs are investigated as product cordial graphs by Vaidya ...sum ...

7

Special Class Of Extended Mean Cordial Graphs

Special Class Of Extended Mean Cordial Graphs

... Product Cordial Graphs, Proceeding of the UGC Sponsored National Conference on Advances in Fuzzy Algebra , Fuzzy Topology and Fuzzay Graphs , Journal ENRICH , ISSN 2319-6394, January 2015, PP ...

12

Results On Cycle Related Hetro-Cordial Graphs

Results On Cycle Related Hetro-Cordial Graphs

... Product Cordial Graphs, Proceeding of the UGC Sponsored National Conference on Advances in Fuzzy Algebra , Fuzzy Topology and Fuzzay Graphs , Journal ENRICH , ISSN 2319-6394, January 2015, PP ...

6

Vertex Switching in 3-Product Cordial Graphs

Vertex Switching in 3-Product Cordial Graphs

... [2]. Cordial labeling is a weaker version of graceful labeling and harmonious labeling introduced by Cahit in ...a cordial labeling of G if the number of vertices labeled 0 and the number of vertices ...

9

k-Remainder Cordial Graphs

k-Remainder Cordial Graphs

... of cordial labeling of ...of graphs and investigated the remainder cordial labeling behavior of several graphs like path, cycle, complete graph, star, bistar ...remainder cordial ...

12

Some Cycle Related 4-cordial Graphs

Some Cycle Related 4-cordial Graphs

... Keywords: Abelian group; 4-cordial labeling; middle graph; splitting graph; double wheel; flower graph.. A graph labeling is an assignment of integers to the vertices or edges [r] ...

10

Existence and Non-Existence of some V4 Cordial graphs

Existence and Non-Existence of some V4 Cordial graphs

... a cordial labeling if the number of vertices labeled 0 and the the number of vertices labeled 1 differ by atmost 1 and also the number of edges labeled 0 and the the number of edges labeled 1 differ by atmost ...

7

Star Attached Divisor Cordial Graphs

Star Attached Divisor Cordial Graphs

... A divisor cordial labeling of graph G with vertex set V is bijection from V to {1,2,……..V(G)} such that if each edge uv is assigned the label 1 if f(u)/ f(v) or f(v)/f(u) and 0 otherwise, then the number of edges ...

7

A note on 3-Prime cordial graphs

A note on 3-Prime cordial graphs

... of cordial labeling of graphs ...prime cordial labeling. A prime cordial labeling of a graph G with vertex set V is a bijection f : V → {1, 2, ...prime cordial labeling behavior of ...

11

Some EP-cordial Graphs

Some EP-cordial Graphs

... The graphs considered are finite,simple and ...product cordial) labeling of a graph G as a function f from the verticies of a graph to {0,1,-1} such that if each edge uv is assigned the label f(u)f(v),then ...

5

Divisor Cordial Labeling Of Cycle Related Graphs

Divisor Cordial Labeling Of Cycle Related Graphs

... Abstract- A divisor cordial labeling of a graph G is a bijection f from V (G) to {1, 2, . . . , |V (G)|} such that an edge uv is assigned the label 1 if f (u)| f (v) or f (v)| f (u) and the label 0 otherwise, then ...

8

Prime Cordial Labeling of Some Graphs

Prime Cordial Labeling of Some Graphs

... As not every graph admit prime cordial labeling it is very interesting to investigate graph or graph famili which admit prime cordial labeling. In this paper we have in- vestigated some new prime ...

6

Product cordial labeling for alternate snake graphs

Product cordial labeling for alternate snake graphs

... product cordial then q < p 2 4 −1 + ...the graphs obtained by joining apex vertices of k copies of stars, shells and wheels to a new vertex are product cordial while Vaidya and Kanani[6] have ...

9

An square Divisor Cordial Labelling of Graphs

An square Divisor Cordial Labelling of Graphs

... divisor cordial labelling is a variant of cordial labelling and divisor cordial ...the graphs like flower ,bistar ,restricted Square Graph Of Shadow graph of ,as Well as Splitting ...

7

$k$-Total prime cordial labeling of graphs

$k$-Total prime cordial labeling of graphs

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

7

Vertex Odd Divisor Cordial Labeling Of Graphs

Vertex Odd Divisor Cordial Labeling Of Graphs

... divisor cordial graphs under some conditions. Every divisor cordial graphs need not be vertex odd divisor cordial ...divisor cordial graphs need not be divisor ...

6

Show all 2305 documents...

Related subjects