Results 61 to 70 of about 302 (172)
Multiply Divisor Cordial Labeling
International Journal of Engineering and Advanced Technology, 2019 A Graph G* having multiply divisor cordial labeling with node set V* is a bijective. t on V * to {1,2,…,V * } such that an edge ab is allocate the label 1 if 2 divides (t (a) t (b)) and 0 otherwise, then the number of edges having label 0 and the number of edges having label 1 differ by maximum 1.
J.T. Gondalia, A.H. Rokad
openaire +1 more source
Subtract Divisor Cordial Labeling
International Journal of Innovative Technology and Exploring Engineering, 2019 A subtract divisor cordial labeling is bijection r: Z (G+ ) → {1,2,…,|V(G+ )|} in such a way that an edge uv give the label 1 if r(u) - r(v) is divisible by 2 otherwise give the label 0, then absolute difference of number of edges having label 1 and 0 is at most 1.
openaire +1 more source
Prime Cordial Labeling On Graphs
, 2013 A prime cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, ..., |V |} such that each edge uv is assigned the label 1 if gcd(f(u), f(v)) = 1 and 0 if gcd(f(u), f(v)) > 1, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1.
S. Babitha, J. Baskar Babujee
openaire +2 more sources
SIGNED CORDIAL LABELING AND SIGNED PRODUCT CORDIAL LABELING OF SOME INTERCONNECTION NETWORKS
Advances and Applications in Discrete Mathematics, 2021 Cynthia, V. Jude Annie, Padmavathy, E.
openaire +2 more sources
PMC-LABELING OF SOME CLASSES OF GRAPHS CONTAINING CYCLES
BarekengLet be a graph with p vertices and q edges. We have introduced a new graph labeling method using integers and cordial-related works and investigated some graphs for this labeling technique.
R Ponraj, S Prabhu, M Sivakumar
doaj +1 more source
Difference Cordial Labelling and Product Cordial Labelling in Some Extended Graphs
This paper presents the existence of Difference Cordial Labelling and product cordial labelling, with an extensive study on labelling of Konigsberg bridge problem and Möbius–Kantor Graph. The authors investigate the difference cordial labelling behaviour of certain graphs, including path, cycle, star, and comb.
openaire +2 more sources
Cordial, Total Cordial, Edge Cordial, Total Edge Cordial Labeling of Some Box Type Fractal Graphs
International Journal of Algebra and Statistics, 2012 This paper deals with the concept of self-similarity fractals of three types of box type fractal with existence of cordial and Edge cordial labeling. A square graph is considered as base for square fractals which leads to construction of some box type fractals. For our study each iteration and the generalized form are considered as graph.
A. A. Sathakathulla +2 more
openaire +1 more source
Quotient Cordial Labeling Of Graphs
, 2016 In this paper we introduce quotient cordial labeling of graphs, respectively denote the number of edges labelled with even integers and number of edges labelled with odd integers. A graph with a quotient cordial labeling is called a quotient cordial graph.
Ponraj, R., Adaickala, Maria , Kala, R.
openaire +2 more sources
Survey on Patients\' Satisfaction with the Services Provided at Pharmacies in the City of Kashan [PDF]
Journal of Advanced Biomedical Sciences, 2019 Background & Objective: Patients’ satisfaction is a key factor in the evaluation of health system’s quality in developed countries. The purpose of the presnt study was to investigate Patients’ satisfaction with services provided at pharmacies in the city
Hamidreza Banafsheh +2 more
doaj