Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Wahyujati, Mohamad Fahruli"'
Publikováno v:
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, Vol 31, Iss 2, Pp 177-189 (2023)
A simple undirected graph = (V Γ, EΓ) admits an H-covering if every edge in E belongs to at least one subgraph of that is isomorphic to a graph H. For any graph admitting H-covering, a total labelling β : VΓ ∪EΓ→{1, 2, …, p} is called an H
Externí odkaz:
https://doaj.org/article/4e4e5ba2b0ff443290c729594477f8dc
A simple undirected graph $\Gamma=(V_\Gamma,E_\Gamma)$ admits an $H$-covering if every edge in $E_\Gamma$ belongs to at least one subgraph of $\Gamma$ that isomorphic to a graph $H$. For any graph $\Gamma$ admitting $H$-covering, a total Labelling $\
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b632f19cfb21a6edd3ae9c27fd2149f7
https://doi.org/10.20944/preprints202208.0274.v1
https://doi.org/10.20944/preprints202208.0274.v1
