# Finding cut-vertices in the square roots of a graph

1 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués, CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : The square of a given graph $H = (V, E)$ is obtained from $H$ by adding an edge between every two vertices at distance two in $H$. Given a graph class ${\cal H}$, the ${\cal H}$-Square Root problem asks for the recognition of the squares of graphs in ${\cal H}$. In this paper, we answer positively to an open question of [Golovach et al., IWOCA'16] by showing that the squares of cactus block graphs can be recognized in polynomial time. Our proof is based on new relationships between the decomposition of a graph by cut-vertices and the decomposition of its square by clique cutsets. More precisely, we prove that the closed neighbourhoods of cut-vertices in $H$ induce maximal prime complete subgraphs of $G = H^2$. Furthermore, based on this relationship, we introduce a quite complete machinery in order to compute from a given graph $G$ the block-cut tree of a desired square root (if any). Although the latter tree is not uniquely defined, we show surprisingly that it can only differ marginally between two different roots. Our approach not only gives the first polynomial-time algorithm for the ${\cal H}$-Square Root problem in different graph classes ${\cal H}$, but it also provides a unifying framework for the recognition of the squares of trees, block graphs and cactus graphs — among others.
Keywords :
Type de document :
Rapport
[Research Report] Université Côte d’Azur, Inria, CNRS, I3S, France. 2017
Domaine :
Liste complète des métadonnées

Littérature citée [46 références]

https://hal.archives-ouvertes.fr/hal-01477981
Contributeur : Guillaume Ducoffe <>
Soumis le : vendredi 21 avril 2017 - 09:35:25
Dernière modification le : jeudi 7 février 2019 - 15:09:09
Document(s) archivé(s) le : samedi 22 juillet 2017 - 12:20:16

### Fichier

square-root.pdf
Fichiers produits par l'(les) auteur(s)

### Identifiants

• HAL Id : hal-01477981, version 2

### Citation

Guillaume Ducoffe. Finding cut-vertices in the square roots of a graph. [Research Report] Université Côte d’Azur, Inria, CNRS, I3S, France. 2017. 〈hal-01477981v2〉

### Métriques

Consultations de la notice

## 895

Téléchargements de fichiers