Equitability, edge-injectivity, and the 1-2-3 Conjecture - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2016

Equitability, edge-injectivity, and the 1-2-3 Conjecture

Résumé

This paper is dedicated to studying the following question: Is it always possible to injec-tively assign the weights 1, ..., |E(G)| to the edges of any given graph G (with no component isomorphic to K 2), so that every two adjacent vertices of G get distinguished by their sums of incident weights? We answer positively to this question for some classes of graphs, such as trees and regular graphs, while, for some other classes of graphs, such as 2-degenerate graphs and graphs with maximum average degree at most 3, we prove that, provided we use a constant number of additional edge weights, the claimed assignment always exists. Our investigations here, are strongly related to several aspects of the well-known 1-2-3 Conjecture and the Antimagic Labelling Conjecture.
Fichier principal
Vignette du fichier
123-injective.pdf (336.37 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01361482 , version 1 (07-09-2016)
hal-01361482 , version 2 (04-04-2017)
hal-01361482 , version 3 (07-08-2017)

Identifiants

  • HAL Id : hal-01361482 , version 1

Citer

Julien Bensmail, Mohammed Senhaji, Kasper Szabo Lyngsie. Equitability, edge-injectivity, and the 1-2-3 Conjecture. 2016. ⟨hal-01361482v1⟩
1081 Consultations
1137 Téléchargements

Partager

Gmail Facebook X LinkedIn More