Irregularity Notions for Digraphs - Archive ouverte HAL Access content directly
Reports Year : 2023

Irregularity Notions for Digraphs


Locally irregular graphs are those graphs in which any two adjacent vertices have different degrees, while locally irregular decompositions are edge-partitions of graphs where each part induces a locally irregular graph. These notions were introduced in a seminal work of Baudon \textit{et al.}, in connection, in particular, to the so-called 1-2-3 Conjecture. Since then, several of their aspects of interest have been investigated in literature, including the existence of such decompositions with few parts, and the complexity of finding such ones. In this work, we pursue investigations on generalisations of these notions to digraphs. In particular, we mainly investigate one variant in which the notion of irregularity for a digraph requires, for every arc from a vertex $u$ to a vertex $v$, the outdegree of $u$ be different from the indegree of $v$. We establish several results on this variant, covering upper bounds on the number of needed parts in decompositions, complexity aspects, and the impact of being able to choose the graph orientation, which results we compare to both the undirected setting and previous investigations on the directed one.
Fichier principal
Vignette du fichier
irregularity-digraphs.pdf (660.28 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04210649 , version 1 (19-09-2023)


  • HAL Id : hal-04210649 , version 1


Julien Bensmail, Thomas Filasto, Hervé Hocquard, Pierre-Marie Marcille. Irregularity Notions for Digraphs. Université côte d'azur; Université de bordeaux; Université paris saclay. 2023. ⟨hal-04210649⟩
40 View
10 Download


Gmail Facebook X LinkedIn More