On certain prime cordial families of graphs
Graph labelling is an important tool in modelling real life problems. In the present paper, different graph families are studied for prime cordial labelling. In this work, we show that the double comb graph ${P_n} \odot 2{K_1} $, for $n \ge 2 $, as well as sunflower planar graph $S{f_n} $ for $n \ge...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-01-01
|
| Series: | Journal of Taibah University for Science |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1080/16583655.2020.1756561 |
| _version_ | 1818332427183980544 |
|---|---|
| author | Nazeran Idrees Sumiya Nasir Fozia Bashir Farooq Maria Majeed |
| author_facet | Nazeran Idrees Sumiya Nasir Fozia Bashir Farooq Maria Majeed |
| author_sort | Nazeran Idrees |
| collection | DOAJ |
| description | Graph labelling is an important tool in modelling real life problems. In the present paper, different graph families are studied for prime cordial labelling. In this work, we show that the double comb graph ${P_n} \odot 2{K_1} $, for $n \ge 2 $, as well as sunflower planar graph $S{f_n} $ for $n \ge 3 $, admit prime cordial labelling. We also prove that if we join two copies of sunflower planar graph by a path of arbitrary length then the resultant graph is also prime cordial. |
| first_indexed | 2024-12-13T13:35:34Z |
| format | Article |
| id | doaj.art-852cd39a0b1a402faa7661fc46f6cbb1 |
| institution | Directory Open Access Journal |
| issn | 1658-3655 |
| language | English |
| last_indexed | 2024-12-13T13:35:34Z |
| publishDate | 2020-01-01 |
| publisher | Taylor & Francis Group |
| record_format | Article |
| series | Journal of Taibah University for Science |
| spelling | doaj.art-852cd39a0b1a402faa7661fc46f6cbb12022-12-21T23:43:51ZengTaylor & Francis GroupJournal of Taibah University for Science1658-36552020-01-0114157958410.1080/16583655.2020.17565611756561On certain prime cordial families of graphsNazeran Idrees0Sumiya Nasir1Fozia Bashir Farooq2Maria Majeed3Department of Mathematics, Government College University FaisalabadCollege of Science and Human Studies, Prince Mohammad Bin Fahd UniversityDepartment of Mathematics, Al-Imam Mohammad Ibn Saud Islamic UniversityDepartment of Mathematics, Government College University FaisalabadGraph labelling is an important tool in modelling real life problems. In the present paper, different graph families are studied for prime cordial labelling. In this work, we show that the double comb graph ${P_n} \odot 2{K_1} $, for $n \ge 2 $, as well as sunflower planar graph $S{f_n} $ for $n \ge 3 $, admit prime cordial labelling. We also prove that if we join two copies of sunflower planar graph by a path of arbitrary length then the resultant graph is also prime cordial.http://dx.doi.org/10.1080/16583655.2020.1756561double comb graphsunflower graphcordial labellingprime cordial labelling |
| spellingShingle | Nazeran Idrees Sumiya Nasir Fozia Bashir Farooq Maria Majeed On certain prime cordial families of graphs Journal of Taibah University for Science double comb graph sunflower graph cordial labelling prime cordial labelling |
| title | On certain prime cordial families of graphs |
| title_full | On certain prime cordial families of graphs |
| title_fullStr | On certain prime cordial families of graphs |
| title_full_unstemmed | On certain prime cordial families of graphs |
| title_short | On certain prime cordial families of graphs |
| title_sort | on certain prime cordial families of graphs |
| topic | double comb graph sunflower graph cordial labelling prime cordial labelling |
| url | http://dx.doi.org/10.1080/16583655.2020.1756561 |
| work_keys_str_mv | AT nazeranidrees oncertainprimecordialfamiliesofgraphs AT sumiyanasir oncertainprimecordialfamiliesofgraphs AT foziabashirfarooq oncertainprimecordialfamiliesofgraphs AT mariamajeed oncertainprimecordialfamiliesofgraphs |