QR Code

On 14-regular distance magic graphs

<p><span>Let </span><span class="math inline"><em>G</em></span><span> be a graph with </span><span class="math inline"><em>n</em></span><span> vertices. By </span><span class="math inline"><em>N</em>(<em>v</em>)</span><span> we denote the set of all vertices adjacent to </span><span class="math inli...

Description complète

Enregistré dans:
Détails bibliographiques
Auteurs principaux: Petr Kovář, Matěj Krbeček
Format: Artigo
Langue:Inglês
Publié: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2024-04-01
Collection:Electronic Journal of Graph Theory and Applications
Sujets:
Accès en ligne:http://www.ejgta.org/index.php/ejgta/article/view/766
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!