The distance magic property and two families of Cartesian product graphs

<p><span>Let </span><span class="math inline"><em>G</em> = <em>G</em>(<em>V</em>, <em>E</em>)</span><span> be a simple graph. The graph </span><span class="math inline"><em>G</em></span><span> is said to be </span><span><em>distance magic</em></span><span> if there exists a bijection </span><span cl...

Fuld beskrivelse

Bibliografiske detaljer

Hovedforfatter:	Patrick Thomas Headley
Format:	Artigo
Sprog:	Inglês
Udgivet:	Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2025-04-01
Serier:	Electronic Journal of Graph Theory and Applications
Fag:	distance magic graph labeling cartesian product graph complete graph complete bipartite graph cycle graph
Online adgang:	http://www.ejgta.org/index.php/ejgta/article/view/858
Tags:	Tilføj Tag Ingen Tags, Vær først til at tagge denne postø!