On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture

This paper is dedicated to studying the following question: Is it always possible to injectively assign the weights 1, ..., |E(G)| to the edges of any given graph G (with no component isomorphic to K2) so that every two adjacent vertices of G get distinguished by their sums of incident weights? One...

Descripció completa

Dades bibliogràfiques

Autors principals:	Julien Bensmail, Mohammed Senhaji, Kasper Szabo Lyngsie
Format:	Artigo
Idioma:	Inglês
Publicat:	Discrete Mathematics & Theoretical Computer Science 2017-08-01
Col·lecció:	Discrete Mathematics & Theoretical Computer Science
Matèries:	1-2-3 conjecture antimagic labelling conjecture equitable edge-weightings [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Accés en línia:	https://dmtcs.episciences.org/2168/pdf
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!