• No results found

sum divisor cordial graph.

Some New Results on Sum Divisor Cordial Graphs

Some New Results on Sum Divisor Cordial Graphs

... a sum divisor cordial labeling if | e f (0) − e f (1) | ≤ 1 ...A graph which admits a sum divisor cordial labeling is called a sum divisor cordial ...

8

Some New Families of Sum Divisor Cordial Graphs

Some New Families of Sum Divisor Cordial Graphs

... A sum divisor cordial labeling of a graph G with vertex set V is a bijection f from V(G) to {1,2,…, |V(G)|} such that an edge uv is assigned the label 1 if 2 divides f(u)+f(v) and 0 otherwise, ...

5

Abstract. In this paper, we investigate the face sum divisor cordial labeling of switching

Abstract. In this paper, we investigate the face sum divisor cordial labeling of switching

... face. Also the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1 and the number of faces labeled with 0 and the number of faces labeled with 1 differ by at most 1. A graph ...

8

Sum Divisor Cordial Labeling of Herschel Graph

Sum Divisor Cordial Labeling of Herschel Graph

... A sum divisor cordial labeling of a graph G with vertex set V G ( ) is a bijection f from V G ( ) to {1, ...A graph with a sum divisor cordial labeling is called a ...

8

Several result on SD-prime cordial graphs

Several result on SD-prime cordial graphs

... SD-prime cordial graphs were discussed in [6, 7, 8, 9]. The idea of a graph associated to zero-divisors of a commutative ring was introduced by ...zero-divisor graph of R is the simple ...

7

Cube Divisor Cordial Labeling For Some Graphs

Cube Divisor Cordial Labeling For Some Graphs

... A graph ( , ) is of vertices and ...Cube Divisor Cordial Graph were introduced by ...simple graph and ∶ ( ) → 1, 2, … , | ( )| be a ...Cube Divisor Cordial Labeling if | ...

6

Vol 9, No 2 (2018)

Vol 9, No 2 (2018)

... A graph G is said to be sum cordial graph if it has a sum cordial ...a graph associated to zero-divisors of a commutative ring was introduced by ...zero-divisor ...

6

Sum Divisor Cordial Labeling of Theta Graph

Sum Divisor Cordial Labeling of Theta Graph

... Theta graph and some graph operations in Theta graph namely fusion, duplication, switching of a central vertex, path union of two copies and the star of ...

8

Divisor Cordial Labeling Of Cycle Related Graphs

Divisor Cordial Labeling Of Cycle Related Graphs

... A divisor cordial labeling of a graph G is a bijection f from V (G) to {1, 2, ...A graph with a divisor cordial labeling is called a divisor cordial ...are ...

8

Vol 8, No 4 (2017)

Vol 8, No 4 (2017)

... of graph labeling. For graph theoretic terminologies and notations we follow Harary ...of graph labeling can be attributed to Rosa ...relaxed cordial graphs were introduced by ...absolute ...

7

Vol 9, No 8 (2018)

Vol 9, No 8 (2018)

... - graph and 𝑓 ∶ 𝑉 → {𝐹 1 , 𝐹 2 , 𝐹 3 , …, 𝐹 𝑝 } where 𝐹 𝑖 is the 𝑖 𝑡ℎ Fibonacci number, be a ...Fibonacci divisor cordial labeling �𝑒 𝑓 (0) − 𝑒 𝑓 (1)� ≤ 1 . A graph with a Fibonacci ...

6

New Results on Labelings of Central Graph of Barbell Graph

New Results on Labelings of Central Graph of Barbell Graph

... In this paper, we have examined the existence of root mean square, square sum, square difference, cordial, total cordial labelings for central graph of barbell graph for all P ≥ 3 and ...

9

Some Results On Divisor Cordial Labeling Of Graphs

Some Results On Divisor Cordial Labeling Of Graphs

... a graph, we mean a finite, undirected graph without loops and multiple edges, for terms not defined here, we refer to Harary ...and graph labeling, we refer to Gallian ...of cordial labeling ...

6

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 ...product cordial graphs by Vaidya ...a graph G with induce edge labeling f ∗ : E ( G ) ...

7

Vertex Odd Divisor Cordial Labeling Of Graphs

Vertex Odd Divisor Cordial Labeling Of Graphs

... a graph, we mean a finite, undirected graph without loops and multiple edges, for terms not defined here, we refer to Harary ...and graph labeling, we refer to Gallian ...of cordial labeling ...

6

Some Star and Bistar Related Divisor Cordial Graphs

Some Star and Bistar Related Divisor Cordial Graphs

... A graph with a divisor cordial labeling is called a divisor cordial ...are divisor cordial ...splitting graph of B n n , , shadow graph of B n n , and square ...

11

AT MOST EDGE 3 – SUM CORDIAL LABELING FOR SOME GRAPHS THE STANDARD

AT MOST EDGE 3 – SUM CORDIAL LABELING FOR SOME GRAPHS THE STANDARD

... a graph G, p and q denote the number of vertices and edges ...as graph labeling. A detailed study on variety of applications on graph labeling is carried out in Bloom and ...Golomb[1]. Cordial ...

11

DIVISOR CORDIAL LABELING IN THE CONTEXT OF JOIN AND BARYCENTRIC SUBDIVISION

DIVISOR CORDIAL LABELING IN THE CONTEXT OF JOIN AND BARYCENTRIC SUBDIVISION

... Mohit Ishvarlal Bosmia has completed his BSc and MSc from Saurashtra Univer- sity, Rajkot, Gujarat and the Maharaja Sayajirao University of Baroda, Vadodara, Gujarat, respectively. He has 12 years of teaching experience. ...

9

Further Results on Divisor Cordial Labeling

Further Results on Divisor Cordial Labeling

... The concept of prime cordial labeling was introduced by Sundaram et al. [7] and in the same paper they have investigated several results on prime cordial labeling. Vaidya and Vihol [8, 9] as well as Vaidya ...

10

Cordiality in the context of duplication in crown related graphs

Cordiality in the context of duplication in crown related graphs

... a graph and let f : V (G) → {0, 1} be a mapping from the set of vertices to {0,1} and for each edge uv ∈ E assign the label | f (u) − f ...a cordial labeling. We discuss cordial labeling of graphs ...

16

Show all 10000 documents...

Related subjects