A C3 Magic Decomposition on Friendship Graph with Odd Order
Let G = (V,E) is graph with a non-empty set V containing vertices and a set of edges E. Also note that if H = {H_i⊆G_i = 1,2,3,...,n} is a collection of subgraphs from G with H_i≅Hj,i ≠ j. If Hi ∩ Hj = ∅ and ⋃n(i-1)Hi = G, then graph G admits a decomposition H. Furthermore, if there are f(v) and g(e...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Fakultas MIPA Universitas Jember
2022-01-01
|
| Series: | Jurnal Ilmu Dasar |
| Online Access: | https://jurnal.unej.ac.id/index.php/JID/article/view/23266 |