On the super edge-magic deficiency of some graphs
A graph G is called super edge-magic if there exists a bijection f:V(G)∪E(G)⟶{1,2,⋯,|V(G)|+|E(G)|}, where f(V(G))={1,2,⋯,|V(G)|}, such that f(u)+f(uv)+f(v) is a constant for every edge uv∈E(G). Such a case, f is called a super edge magic labeling of G. A bipartite graph G with partite sets A and B i...
Na minha lista:
| Principais autores: | , , , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Elsevier
2020-11-01
|
| Serier: | Heliyon |
| Fag: | |
| Online adgang: | http://www.sciencedirect.com/science/article/pii/S240584402032404X |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|