Cargando…
On the super edge-magic deficiency of some graphs
A graph G is called super edge-magic if there exists a bijection [Formula: see text] , where [Formula: see text] , such that [Formula: see text] is a constant for every edge [Formula: see text]. Such a case, f is called a super edge magic labeling of G. A bipartite graph G with partite sets A and B...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Elsevier
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7689529/ https://www.ncbi.nlm.nih.gov/pubmed/33294698 http://dx.doi.org/10.1016/j.heliyon.2020.e05561 |