Edge Irregular Reflexive Labeling for Disjoint Union of Generalized Petersen Graph
A graph labeling is the task of integers, generally spoken to by whole numbers, to the edges or vertices, or both of a graph. Formally, given a graph <inline-formula> <math display="inline"> <semantics> <mrow> <mi>G</mi> <mo>=</mo> <mo str...
| Päätekijät: | , , , |
|---|---|
| Aineistotyyppi: | Artikkeli |
| Kieli: | English |
| Julkaistu: |
MDPI AG
2018-12-01
|
| Sarja: | Mathematics |
| Aiheet: | |
| Linkit: | https://www.mdpi.com/2227-7390/6/12/304 |