Autor: |
Dewi, R. K., Roswitha, M., Martini, T. S. |
Předmět: |
|
Zdroj: |
AIP Conference Proceedings; 2018, Vol. 2023 Issue 1, p020238-1-020238-5, 5p |
Abstrakt: |
A simple graph G = (V, E) admits an H-covering if every edge in E(G) belongs to a subgraph on G that isomorphics to H. A graph G is H-magic if there exists a bijection function f ∶ V (G) ∪E(G) → {1, 2,
, |V (G)| + |E(G)|}, such that for every subgraph H′ = (V ′(H′); E′(H′)) on G satisfied f(H′)= Σv ∈V′ f(v) + Σe ∈E′ f(e) = m(f)where m(f) is a constant magic sum. A graph G is a H -supermagic labeling if f(V ) = {1,2,
, |V (G)|} and S(f) is a constant supermagic sum. This research gives the construction of the corona of Fan and Ladder graphs with a path. [ABSTRACT FROM AUTHOR] |
Databáze: |
Complementary Index |
Externí odkaz: |
|