New families of star-supermagic graphs
Copyright policy )New families of star-supermagic graphs
A simple graph <em>G</em> admits a <em>K</em><sub>1,n</sub>-covering if every edge in <em>E</em>(<em>G</em>) belongs to a subgraph of <em>G</em> isomorphic to <em>K</em><sub>1,n</sub>. The graph <em>G</em> is <em>K</em><sub>1,n</sub>-supermagic if there exists a bijection <em>f</em> : <em>V</em>(<em>G</em>) ∪ <em>E</em>(<em>G</em>) → {1, 2, 3,..., |<em>V</em>(<em>G</em>) ∪ <em>E</em>(<em>G</em>)|} such that for every subgraph <em>H</em>' of <em>G</em> isomorphic to <em>K</em><sub>1,n</sub>, ∑v<sub> ∈ V(H') </sub> f(v) + ∑<sub>e ∈ E(H')</sub> f(e) is a constant and <em>f</em>(<em>V</em>(<em>G</em>)) = {1, 2, 3,..., |<em>V</em>(<em>G</em>)|}. In such a case, <em>f</em> is called a <em>K</em><sub>1,n</sub>-supermagic labeling of <em>G</em>. In this paper, we give a method how to construct <em>K</em><sub>1,n</sub>-supermagic graphs from the old ones.
- Universitas Merdeka Malang Indonesia
QA1-939, $k_{1, n}$-covering \sep $k_{1, n}$-supermagic labeling \sep $k_{1, n}$-supermagic graph, Mathematics
QA1-939, $k_{1, n}$-covering \sep $k_{1, n}$-supermagic labeling \sep $k_{1, n}$-supermagic graph, Mathematics
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!