Bonomo, Flavia and Figueiredo, Celina M. H., and Duran, Guillermo and Grippo, Luciano N. and Safe, Martín D.et al. - On probe 2-clique graphs and probe diamond-free graphs

dmtcs:2122 - Discrete Mathematics & Theoretical Computer Science, March 28, 2015, Vol. 17 no. 1 (in progress)
On probe 2-clique graphs and probe diamond-free graphs

Authors: Bonomo, Flavia and Figueiredo, Celina M. H., and Duran, Guillermo and Grippo, Luciano N. and Safe, Martín D. and Szwarcfiter, Jayme L.

Given a class G of graphs, probe G graphs are defined as follows. A graph G is probe G if there exists a partition of its vertices into a set of probe vertices and a stable set of nonprobe vertices in such a way that non-edges of G, whose endpoints are nonprobe vertices, can be added so that the resulting graph belongs to G. We investigate probe 2-clique graphs and probe diamond-free graphs. For probe 2-clique graphs, we present a polynomial-time recognition algorithm. Probe diamond-free graphs are characterized by minimal forbidden induced subgraphs. As a by-product, it is proved that the class of probe block graphs is the intersection between the classes of chordal graphs and probe diamond-free graphs.


Source : oai:HAL:hal-01196866v1
Volume: Vol. 17 no. 1 (in progress)
Section: Graph Theory
Published on: March 28, 2015
Submitted on: January 6, 2014
Keywords: probe graphs,2-clique graphs,diamond-free graphs,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[INFO.INFO-HC] Computer Science [cs]/Human-Computer Interaction [cs.HC]


Share

Browsing statistics

This page has been seen 26 times.
This article's PDF has been downloaded 27 times.