Cordial Labeling of Corona Product of Paths and Fourth Order of Lemniscate Graphs

被引:0
|
作者
Abd El-hay, Atef [1 ]
Alsatami, Khalid A. [2 ]
Elrokh, Ashraf [1 ]
Rabie, Aya [3 ]
机构
[1] Menoufia Univ, Math & Comp Sci Dept, Fac Sci, Menoufia, Egypt
[2] Qassim Univ, Coll Sci, Dept Math, Buraydah, Saudi Arabia
[3] Inst Natl Planning, Dept Planning Tech Ctr, Cairo, Egypt
来源
关键词
Cordial labeling; corona; lemniscate; Social Networking; Network; security; Edge Computing;
D O I
10.29020/nybg.ejpam.v18i1.5470
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A graph G = (V, E) is called cordial if it is possible to label the vertex by the function f : V -> 0, 1 and label the edges by f* : E -> 0, 1, where f*(uv) = (f (u) + f (v))mod2, u, v is an element of V so that |v0-v1|<= 1 and |e0-e1|<= 1.A lemniscate graph is a plane curve with a characteristic shape, consisting of two loops that meet at a central point as shown below. The curve is also known as the lemniscate of Bernoulli. A fourth order of lemniscate graph is a graph of two fourth order of circles that have two vertex in common. In this paper, we give the conditions that the corona product of paths and fourth order of lemniscate graphs be cordial. 2020 Mathematics Subject Classifications: 05C78,05C15
引用
收藏
页数:14
相关论文
共 50 条
  • [21] SECRET CODING TECHNIQUE ON SUNFLOWER GRAPHS WITH PRODUCT CORDIAL LABELING
    Manshath, A.
    Maheswari, G. Uma
    Shainy, V. Shendra
    Balaji, V
    ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2020, 24 (02): : 143 - 156
  • [22] EDGE PRODUCT CORDIAL LABELING OF SWITCHING OPERATION ON SOME GRAPHS
    Prajapati, U. M.
    Patel, N. B.
    TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS, 2022, 12 (01): : 191 - 199
  • [23] PRODUCT AND EDGE PRODUCT CORDIAL LABELING OF DEGREE SPLITTING GRAPH OF SOME GRAPHS
    Vaidya, S. K.
    Barasara, C. M.
    ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2015, 15 (01): : 61 - 74
  • [24] On Prime Cordial Labeling of Graphs
    Aljouiee, Abdullah
    KYUNGPOOK MATHEMATICAL JOURNAL, 2016, 56 (01): : 41 - 46
  • [25] On product cordial graphs
    Seoud, M. A.
    Helmi, E. F.
    ARS COMBINATORIA, 2011, 101 : 519 - 529
  • [26] Zumkeller Cordial Labeling of Graphs
    Murali, B. J.
    Thirusangu, K.
    Meenakshi, R. Madura
    COMPUTATIONAL INTELLIGENCE, CYBER SECURITY AND COMPUTATIONAL MODELS, ICC3 2015, 2016, 412 : 533 - 541
  • [27] PRODUCT CORDIAL LABELING OF DOUBLE WHEEL AND DOUBLE FAN RELATED GRAPHS
    Rokad, A. H.
    KRAGUJEVAC JOURNAL OF MATHEMATICS, 2019, 43 (01): : 7 - 13
  • [28] On The Edge Irregularity Strength Of Corona Product Of Graphs With Paths
    Tarawneh, Ibrahim
    Hasni, Roslan
    Ahmad, Ali
    APPLIED MATHEMATICS E-NOTES, 2016, 16 : 80 - 87
  • [29] Edge Irregular Reflexive Labeling for Corona Product of Graphs
    Ibrahim, Muhammad
    Khan, Muhammad Javed Azhar
    Siddiqui, Muhammad Kamran
    ARS COMBINATORIA, 2020, 152 : 263 - 282
  • [30] ON EDGE PRODUCT CORDIAL GRAPHS
    Ivanco, Jaroslav
    OPUSCULA MATHEMATICA, 2019, 39 (05) : 691 - 703