k-TRIANGULAR PRIME CORDIAL LABELING OF MAXIMAL OUTERPLANAR GRAPHS
Autor: | null G. Megala, null K. Annadurai |
---|---|
Rok vydání: | 2022 |
Zdroj: | jnanabha. 52:126-137 |
ISSN: | 2455-7463 0304-9892 |
DOI: | 10.58250/jnanabha.2022.52215 |
Popis: | In this paper, we study graph labeling, namely, k- triangular prime cordial labeling for k = 1, 2, 3, 4, 5, 6. This is a simple extension of prime cordial labeling where the vertex labels are defined as the higher order triangular numbers. Also we show that the maximal outerplanar graphs are k- triangular prime cordial under certain conditio |
Databáze: | OpenAIRE |
Externí odkaz: |