3-total edge product cordial labeling of rhombic grid
For a simple graph G=(V(G),E(G)), this paper deals with the existence of an edge labeling χ:E(G)→{0,1,…,k−1},2≤k≤|E(G)|, which induces a vertex labeling χ∗:V(G)→{0,1,…,k−1}in such a way that for each vertex v, assigns the label χ(e1)⋅χ(e2)⋅⋯⋅χ(en)((modk)), where e1,e2,…,enare the edges incident to t...
Published in: | AKCE International Journal of Graphs and Combinatorics |
---|---|
Main Authors: | , |
Format: | Article in Journal/Newspaper |
Language: | English |
Published: |
Taylor & Francis Group
2019
|
Subjects: | |
Online Access: | https://doi.org/10.1016/j.akcej.2017.12.002 https://doaj.org/article/a9a4d4d2db9e4de4bbcb6b873425d6db |
id |
ftdoajarticles:oai:doaj.org/article:a9a4d4d2db9e4de4bbcb6b873425d6db |
---|---|
record_format |
openpolar |
spelling |
ftdoajarticles:oai:doaj.org/article:a9a4d4d2db9e4de4bbcb6b873425d6db 2023-05-15T16:06:09+02:00 3-total edge product cordial labeling of rhombic grid Aisha Javed Muhammad Kamran Jamil 2019-08-01T00:00:00Z https://doi.org/10.1016/j.akcej.2017.12.002 https://doaj.org/article/a9a4d4d2db9e4de4bbcb6b873425d6db EN eng Taylor & Francis Group http://www.sciencedirect.com/science/article/pii/S0972860017302323 https://doaj.org/toc/0972-8600 0972-8600 doi:10.1016/j.akcej.2017.12.002 https://doaj.org/article/a9a4d4d2db9e4de4bbcb6b873425d6db AKCE International Journal of Graphs and Combinatorics, Vol 16, Iss 2, Pp 213-221 (2019) Mathematics QA1-939 article 2019 ftdoajarticles https://doi.org/10.1016/j.akcej.2017.12.002 2023-01-08T01:34:49Z For a simple graph G=(V(G),E(G)), this paper deals with the existence of an edge labeling χ:E(G)→{0,1,…,k−1},2≤k≤|E(G)|, which induces a vertex labeling χ∗:V(G)→{0,1,…,k−1}in such a way that for each vertex v, assigns the label χ(e1)⋅χ(e2)⋅⋯⋅χ(en)((modk)), where e1,e2,…,enare the edges incident to the vertex v. The labeling χ is called a k-total edge product cordial labeling of G if |(eχ(i)+vχ∗(i))−(eχ(j)+vχ∗(j))|≤1 for every i,j,0≤i<j≤k−1, where eχ(i)and vχ∗(i)are the number of edges and vertices with χ(e)=i and χ∗(e)=i, respectively. In this paper, we examine the existence of such labeling for rhombic grid graph. Keywords: Cordial labeling, 3-total edge product cordial labeling, Rhombic grid graph Article in Journal/Newspaper Enare Directory of Open Access Journals: DOAJ Articles AKCE International Journal of Graphs and Combinatorics 16 2 213 221 |
institution |
Open Polar |
collection |
Directory of Open Access Journals: DOAJ Articles |
op_collection_id |
ftdoajarticles |
language |
English |
topic |
Mathematics QA1-939 |
spellingShingle |
Mathematics QA1-939 Aisha Javed Muhammad Kamran Jamil 3-total edge product cordial labeling of rhombic grid |
topic_facet |
Mathematics QA1-939 |
description |
For a simple graph G=(V(G),E(G)), this paper deals with the existence of an edge labeling χ:E(G)→{0,1,…,k−1},2≤k≤|E(G)|, which induces a vertex labeling χ∗:V(G)→{0,1,…,k−1}in such a way that for each vertex v, assigns the label χ(e1)⋅χ(e2)⋅⋯⋅χ(en)((modk)), where e1,e2,…,enare the edges incident to the vertex v. The labeling χ is called a k-total edge product cordial labeling of G if |(eχ(i)+vχ∗(i))−(eχ(j)+vχ∗(j))|≤1 for every i,j,0≤i<j≤k−1, where eχ(i)and vχ∗(i)are the number of edges and vertices with χ(e)=i and χ∗(e)=i, respectively. In this paper, we examine the existence of such labeling for rhombic grid graph. Keywords: Cordial labeling, 3-total edge product cordial labeling, Rhombic grid graph |
format |
Article in Journal/Newspaper |
author |
Aisha Javed Muhammad Kamran Jamil |
author_facet |
Aisha Javed Muhammad Kamran Jamil |
author_sort |
Aisha Javed |
title |
3-total edge product cordial labeling of rhombic grid |
title_short |
3-total edge product cordial labeling of rhombic grid |
title_full |
3-total edge product cordial labeling of rhombic grid |
title_fullStr |
3-total edge product cordial labeling of rhombic grid |
title_full_unstemmed |
3-total edge product cordial labeling of rhombic grid |
title_sort |
3-total edge product cordial labeling of rhombic grid |
publisher |
Taylor & Francis Group |
publishDate |
2019 |
url |
https://doi.org/10.1016/j.akcej.2017.12.002 https://doaj.org/article/a9a4d4d2db9e4de4bbcb6b873425d6db |
genre |
Enare |
genre_facet |
Enare |
op_source |
AKCE International Journal of Graphs and Combinatorics, Vol 16, Iss 2, Pp 213-221 (2019) |
op_relation |
http://www.sciencedirect.com/science/article/pii/S0972860017302323 https://doaj.org/toc/0972-8600 0972-8600 doi:10.1016/j.akcej.2017.12.002 https://doaj.org/article/a9a4d4d2db9e4de4bbcb6b873425d6db |
op_doi |
https://doi.org/10.1016/j.akcej.2017.12.002 |
container_title |
AKCE International Journal of Graphs and Combinatorics |
container_volume |
16 |
container_issue |
2 |
container_start_page |
213 |
op_container_end_page |
221 |
_version_ |
1766402068899168256 |