star-supermagic decompositions of the complete bipartite graph minus a one-factor

Clicks: 55
ID: 249838
2017
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Emerging

Ranked #239 of 403 articles by views in structural engineering and mechanics

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 403 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Abstract
Let G be a graph and let H be a subgraph of G. Assume that G has an H-decomposition T={H1,H2,…,Ht} such that Hi≅H for all 1≤i≤t. An H-supermagic decomposition of G is a bijection f:V(G)∪E(G)→1,2,…,VG+EG such that ∑v∈V(Hi)f(v)+∑e∈E(Hi)f(e) is a constant k for each Hi in the decomposition T and fVG=1,2,…,VG. If G admits an H-supermagic decomposition, then G is called H-supermagic decomposable. In this paper, we give necessary and sufficient conditions for the existence of K1,n-1-supermagic decomposition of the complete bipartite graph Kn,n minus a one-factor.
Reference Key
wichianpaisarn2017internationalstar-supermagic Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Tanawat Wichianpaisarn;Uthoomporn Mato
Journal structural engineering and mechanics
Year 2017
DOI
10.1155/2017/5104701
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.