|
Twitter
|
Facebook
|
Google+
|
VKontakte
|
LinkedIn
|
Viadeo
|
English
|
Français
|
Español
|
العربية
|
 
International Journal of Innovation and Applied Studies
ISSN: 2028-9324     CODEN: IJIABO     OCLC Number: 828807274     ZDB-ID: 2703985-7
 
 
Tuesday 22 September 2020

About IJIAS

News

Submission

Downloads

Archives

Custom Search

Contact

Connect with IJIAS

  Now IJIAS is indexed in EBSCO, ResearchGate, ProQuest, Chemical Abstracts Service, Index Copernicus, IET Inspec Direct, Ulrichs Web, Google Scholar, CAS Abstracts, J-Gate, UDL Library, CiteSeerX, WorldCat, Scirus, Research Bible and getCited, etc.  
 
 
 

SOME RESULTS ON FUZZY DIVISOR CORDIAL GRAPHS


Volume 27, Issue 2, September 2019, Pages 632–637

 SOME RESULTS ON FUZZY DIVISOR CORDIAL GRAPHS

Mohammed M. Ali Al-Shamiri1, S.I. Nada2, A.I. Elrokh3, and Yasser Elmshtaye4

1 Department of Mathematics, Faculty of Sciences and Arts, Mohayel Assir, King Khalid University, Saudi Arabia
2 Department of Mathematics, Faculty of Sciences, Munofia University, Monofia, Egypt
3 Department of Mathematics, Faculty of Sciences, Munofia University, Monofia, Egypt
4 Department of Mathematics, Faculty of Sciences and Arts, Mohayel Assir, King Khalid University, Saudi Arabia

Original language: English

Received 19 September 2019

Copyright © 2019 ISSR Journals. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract


A fuzzy divisor cordial labeling of a fuzzy simple graph G = (σ,µ) be a bijection σ from V to [0,1] such that if each edge μυ is assigned the label d if either σ(u) | σ(v) or σ(v) | σ(v) where d ∈ (0,1), and the label 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with d differ by at most 1. If a graph has a fuzzy divisor cordial labeling, then it is called fuzzy divisor cordial graph. In this paper, we proved that path, cycle, wheel graph, star graph, some complete bipartite graphs, shell graph S_n,S(K_(1,n)) graph, graph and the Helm H_n graph are fuzzy divisor cordial graph.

Author Keywords: Fuzzy Divisor Cordial Labeling, Fuzzy Divisor Cordial Graph, Fuzzy Labeling.


How to Cite this Article


Mohammed M. Ali Al-Shamiri, S.I. Nada, A.I. Elrokh, and Yasser Elmshtaye, “SOME RESULTS ON FUZZY DIVISOR CORDIAL GRAPHS,” International Journal of Innovation and Applied Studies, vol. 27, no. 2, pp. 632–637, September 2019.