Zobrazeno 1 - 6
of 6
pro vyhledávání: '"H-magic decomposition"'
Publikováno v:
Indonesian Journal of Combinatorics, Vol 2, Iss 2, Pp 72-81 (2018)
Let H and G be two simple graphs. The concept of an H-magic decomposition of G arises from the combination between graph decomposition and graph labeling. A decomposition of a graph G into isomorphic copies of a graph H is H-magic if there is a bijec
Externí odkaz:
https://doaj.org/article/90bfa60359274228a8a73e3ae2bb486e
Publikováno v:
AIP Conference Proceedings. 2018, Vol. 2023 Issue 1, p020193-1-020193-9. 9p.
Publikováno v:
Indonesian Journal of Combinatorics, Vol 2, Iss 2, Pp 72-81 (2018)
Let H and G be two simple graphs. The concept of an H-magic decomposition of G arises from the combination between graph decomposition and graph labeling. A decomposition of a graph G into isomorphic copies of a graph H is H-magic if there is a bijec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::20200ef19aba307e6cc2a46c2ed5a415
https://doi.org/10.19184/ijc.2018.2.2.2
https://doi.org/10.19184/ijc.2018.2.2.2
Publikováno v:
Electronic Journal of Graph Theory & Applications; 2024, Vol. 12 Issue 2, p189-203, 15p
Autor:
Hendy
Publikováno v:
AIP Conference Proceedings; 2016, Vol. 1707 Issue 1, p1-5, 5p, 4 Diagrams
Publikováno v:
AIP Conference Proceedings.
Let H and G be two simple graphs. The topic of an H-magic decomposition of G arises from the combination of graph decomposition and graph labeling. A decomposition of a graph G into isomorphic copies of a graph H is H - magic if there is a bijection
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1536cb35b173222cab36221ada371bd3
https://doi.org/10.1063/1.5064190
https://doi.org/10.1063/1.5064190