| Autor: |
Wenhui Ma, Guanghua Dong, Yingyu Lu, Ning Wang |
| Jazyk: |
angličtina |
| Rok vydání: |
2018 |
| Předmět: |
|
| Zdroj: |
AKCE International Journal of Graphs and Combinatorics, Vol 15, Iss 3, Pp 271-283 (2018) |
| Druh dokumentu: |
article |
| ISSN: |
0972-8600 |
| DOI: |
10.1016/j.akcej.2017.10.005 |
| Popis: |
A graph with q edges is called a n t i m a g i c if its edges can be labeled with 1, 2, …, q such that the sums of the labels on the edges incident to each vertex are distinct. Hartsfield and Ringel conjectured that every connected graph other than K 2 is antimagic. In this paper, through a labeling method and a modification on this labeling, we obtained that the lexicographic product graphs P m [ P n ] are antimagic. Keywords: Antimagic graph, Lexicographic product, Path |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
