• No results found

Sum cordial labeling

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

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

... 3-sum cordial graph which admits an edge sum cordial labeling is called at most edge 3-sum cordial ...3-sum cordial labeling is called at most edge ...

11

3-Total Super Sum Cordial Labeling for Union of Some Graphs

3-Total Super Sum Cordial Labeling for Union of Some Graphs

... of sum cordial labeling of graph was introduced in [5] and that of k-sum cordial labeling in ...total sum cordial labeling of a graph was introduced in ...

6

Vol 9, No 2 (2018)

Vol 9, No 2 (2018)

... and edges with label i, i ∈{0, 1} respectively. A graph G is said to be sum cordial graph if it has a sum cordial labeling. The idea of a graph associated to zero-divisors of a ...

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 [6]. Definition 1.3. A binary vertex labeling ...

7

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

Subtract Divisor Cordial Labeling

Subtract Divisor Cordial Labeling

... In order to fulfillment of the edge condition for subtract divisor cordial graph it is necessary to give label 1 to n edges and label 0 to n edges from total 2n edges. The edge label will increase at least n-1 ...

5

Group $\{1, -1, i, -i\}$ Cordial Labeling of sum of $C_n$ and $K_m$ for some $m$

Group $\{1, -1, i, -i\}$ Cordial Labeling of sum of $C_n$ and $K_m$ for some $m$

... Maximum number of edges that can get label 1 using k vertices is (n + 4) + (n + 3) + (k − 2)5 = 2(4k −3)+7+5k−10 = 13k −9. So a necessary condition to get a group {1, −1, i, −i} Cordial labeling is 13k − 9 ...

11

Intersection Cordial Labeling of Graphs

Intersection Cordial Labeling of Graphs

... vertex labeling [4] of a graph G is an assignment f of labels to the vertices of G that induces for each edge uv a label depend- ing on the vertex label f(u) and f(v) ...known labeling methods are called ...

5

On Signed Product Cordial Labeling

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

Further Results on Divisor Cordial Labeling

Further Results on Divisor Cordial Labeling

... f v f u and the label 0 otherwise, then number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph with a divisor cordial labeling is called a divisor cordial ...

10

Cordial Labeling of Some Graphs

Cordial Labeling of Some Graphs

... Double-Blind Peer Reviewed Refereed Open Access International e-Journal - Included in the International Serial Directories Aryabhatta Journal of Mathematics and Informatics. http://www.[r] ...

9

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

(a, d) – Edge-antimagic Total labeling in Extended Duplicate Graph of Path

(a, d) – Edge-antimagic Total labeling in Extended Duplicate Graph of Path

... graph labeling was introduced by Rosa [3]. Graph labeling is an assignment of integers to the edges or vertices or both subject to certain ...various labeling of graphs such as cordial ...

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

... graph labeling is the assignment of unique identifiers to the edges and vertices of a ...graph labeling problems along with an extensive bibliography we refer to Gallian ...of cordial labeling ...

8

Mean Square Cordial Labeling of Some Snake Graphs

Mean Square Cordial Labeling of Some Snake Graphs

... square cordial labeling. In particular , mean square cordial labeling of a Triangular snake Tk, Subdivision of a triangular snake S(Tk), Quadrilateral snake QSk, Subdivision of a quadrilateral ...

5

Prime Cordial Labeling of Some Graphs

Prime Cordial Labeling of Some Graphs

... prime cordial labeling was introduced by Sundaram [5] et ...cordial labeling. Vaidya and Vihol [6] have also discussed prime cordial labeling in the context of graph operations ...

6

Fibonacci Cordial Labeling of Some Special Graphs

Fibonacci Cordial Labeling of Some Special Graphs

... graph labeling and number ...Fibonacci cordial labeling. Further we have discussed Fibonacci cordial labeling in context of vertex switching and joint sum of different graph ...

12

E-Cordiality of Tail C3Related One Point Union Graphs

E-Cordiality of Tail C3Related One Point Union Graphs

... Proof:There are 5 possible structures on G (k) which are pairwise non-isomorphic depending on common point ‘a’, ‘b’,‘ d’ , ‘e’ or ‘c’ on G. This is clear from fig 4.16.When k ≡1 (mod 4), the structures are not ...

6

Abstract. In this paper, we investigate the SD-Prime cordial labeling of Pl n

Abstract. In this paper, we investigate the SD-Prime cordial labeling of Pl n

... neighborhood-prime labeling, if for every vertex v∈V(G) with deg(v) > 1, gcd {f(u): u ∈ N(v)} = ...neighborhood-prime labeling is called a neighborhood-prime ...

7

Further results on total mean cordial labeling of graphs

Further results on total mean cordial labeling of graphs

... graph labeling is graceful labeling which was introduced by Rosa [8] in ...the cordial labeling of graphs. Cordial labeling behavior of several graphs were studied in ...mean ...

11

Show all 5190 documents...

Related subjects