Cordial Graph
Some New Families of Divisor Cordial Graph
... divisor cordial labeling of a graph G with vertex set V vertex G is a bijection f from V to {1, 2, 3, ...a graph has a divisor cordial labeling, then it is called divisor cordial ...
10
Product Cordial Graph in the Context of Some Graph Operations on Gear Graph
... The graph obtained by vertex switching of the apex vertex in the gear graph again yields us a gear ...gear graph is a product cordial graph if n is odd and it is not a product ...
9
Intuitionistic Fuzzy Divisor Cordial Graph
... simple graph and f : V(G) β {1 ,2, ...divisor cordial labeling if | e f (0) β e f (1) |β€ 1, Where e f (0) denotes the number of edges with label 0 ...
9
TREE RELATIVELY PRIME CORDIAL GRAPH.
... Let πΊ = (π, πΊ) be a graph with π vertices and π edges. A Analytic Mean Cordial Labeling of a Graph G with vertex set is a bijection from π£ = {1,2 β¦ . . π}.The induced edge labelling are defined by ...
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
Face And Total Face Product Cordial Labeling Of Graphs
... vertices out of the n vertices must be assigned label 0, so that the vertex condition for the face product cordial graph is satisfied. But the vertices with label 0 cause at least n+1 edges to have label 0 ...
10
A note on 3-Prime cordial graphs
... a graph G is called order of G, and the number of edges is called size of ...of cordial labeling of graphs ...prime cordial labeling. A prime cordial labeling of a graph G with vertex ...
11
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 graph Ξ(R) is the ...
6
Prime Cordial Labeling for Theta Graph
... A graph which admits a prime cordial labeling is called a prime cordial ...prime cordial labeling of Theta graph. We also discuss prime cordial labeling in the context of some ...
8
Further Results on Divisor Cordial Labeling
... A graph with a divisor cordial labeling is called a divisor cordial ...flower graph Fl n and Gear graph G n are divisor cordial ...
10
Cube Divisor Cordial Labeling For Some Graphs
... A graph ( , ) is of vertices and ...Divisor Cordial Graph were introduced by ...simple graph and βΆ ( ) β 1, 2, β¦ , | ( )| be a ...Divisor Cordial Labeling if | (0) β (1)| β€ ...The ...
6
Vol 6, No 10 (2015)
... product cordial labeling if |ππ(ππ) β ππ(ππ)| β€ 1 where i, j β {-1, 1} and f(x) denotes the total number of vertices and edges with x (x = -1, ...A graph with a k-Total signed product cordial ...
5
Sum Divisor Cordial Labeling of Herschel Graph
... 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 sum divisor cordial ...
8
3-Total Super Sum Cordial Labeling for Union of Some Graphs
... a graph are denoted by and ...the graph with and . The concept of sum cordial labeling of graph was introduced in [5] and that of k-sum cordial labeling in ...sum cordial ...
6
New Results on Labelings of Central Graph of Barbell Graph
... obtained by subdividing each edge of B(p, n) exactly once and joining all the non adjacent vertices of B(p, n). In this paper, the ways to construct root mean square, square sum, square difference, cordial, total ...
9
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
Further Results On Square 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 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
Integer Cordial Labeling of Triangular Snake Graph
... G V G E G having set of vertices V G ο¨ ο© and set of edges E G ο¨ ο© . For the standard notation, we refer Gross and Yellen. 2 The concept of cordial labeling was introduced by I. Cahit 3 in 1987. Definition-1.1: If ...
9
Index of labeling
... Definitionβ1.1 : A function f : V (G) ββ {0, 1} is called a binary vertex labeling of a graph G and f(v) is called label of the vertex v of G under f. The induced func- tion f β : E(G) ββ {0, 1} is defined as f β ...
10