Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Partition of graphs with maximum degree ratio

Valentin Bouquet 1 François Delbot 2 Christophe Picouleau 1
1 CEDRIC - OC - CEDRIC. Optimisation Combinatoire
CEDRIC - Centre d'études et de recherche en informatique et communications
Abstract : Given a graph and a non trivial partition (V1,V2) of its vertices, the satisfaction of a vertex v of Vi, i=1,2 is the ratio between the size of its closed neighborhood in Vi and the total size of its closed neighborhood. The worst ratio over all the vertices defines the quality of the partition. We define q(G) the degree ratio of a graph as the maximum of the worst ratio over all the non trivial partitions. We give bounds and exact values of q(G) for some classes of graphs. We also show some complexity results.
Complete list of metadata
Contributor : Christophe Picouleau Connect in order to contact the contributor
Submitted on : Monday, July 27, 2020 - 10:56:13 AM
Last modification on : Wednesday, March 16, 2022 - 3:44:13 AM

Links full text


  • HAL Id : hal-02907108, version 1
  • ARXIV : 2007.12434


Valentin Bouquet, François Delbot, Christophe Picouleau. Partition of graphs with maximum degree ratio. 2020. ⟨hal-02907108⟩



Record views