QR koda

Super edge-magic labeling for -uniform, complete -uniform and complete -uniform -partite hypergraphs

Let be a hypergraph with a vertex set and a hyperedge set . Generalized from the super edge-magic in a graph, we say that a hypergraph is super edge-magic if there is a bijection : ∪ → {1,2,3, … , | | + | |} which satisfies: (i) there exists a constant Λ such that for all ∈ , ( ) +...

Popoln opis

Shranjeno v:
Bibliografske podrobnosti
Principais autores: Ratinan Boonklurb, Authawich Narissayaporn, Sirirat Singhun
Format: Artigo
Jezik:Inglês
Izdano: Prince of Songkla University 2021-04-01
Serija:Songklanakarin Journal of Science and Technology (SJST)
Teme:
Online dostop:http://rdo.psu.ac.th/sjstweb/journal/43-2/3.pdf
Oznake: Označite
Brez oznak, prvi označite!