On probe 2-clique graphs and probe diamond-free graphs

Autores
Bonomo, Flavia; Figueiredo, Celina M. H. de; Duran, Guillermo Alfredo; Grippo, Luciano Norberto; Safe, Martin Dario; Szwarcfiter, Jayme L.
Año de publicación
2015
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
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.
Fil: Bonomo, Flavia. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Figueiredo, Celina M. H. de. Universidade Federal do Rio de Janeiro; Brasil
Fil: Duran, Guillermo Alfredo. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina. Universidad de Chile; Chile. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Grippo, Luciano Norberto. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Safe, Martin Dario. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Szwarcfiter, Jayme L.. Universidade Federal do Rio de Janeiro; Brasil
Materia
2-Clique Graphs
Diamond-Free Graphs
Probe Graphs
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/21313
Acceder
id CONICETDig_705bfa1fd60b46ed7c574cd25f413931
oai_identifier_str oai:ri.conicet.gov.ar:11336/21313
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling On probe 2-clique graphs and probe diamond-free graphsBonomo, FlaviaFigueiredo, Celina M. H. deDuran, Guillermo AlfredoGrippo, Luciano NorbertoSafe, Martin DarioSzwarcfiter, Jayme L.2-Clique GraphsDiamond-Free GraphsProbe Graphshttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1https://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1Given 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.Fil: Bonomo, Flavia. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Figueiredo, Celina M. H. de. Universidade Federal do Rio de Janeiro; BrasilFil: Duran, Guillermo Alfredo. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina. Universidad de Chile; Chile. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Grippo, Luciano Norberto. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Safe, Martin Dario. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Szwarcfiter, Jayme L.. Universidade Federal do Rio de Janeiro; BrasilChapman & Hall2015-03info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/21313Bonomo, Flavia; Figueiredo, Celina M. H. de; Duran, Guillermo Alfredo; Grippo, Luciano Norberto; Safe, Martin Dario; et al.; On probe 2-clique graphs and probe diamond-free graphs; Chapman & Hall; Discrete Mathematics and Theoretical Computer Science; 17; 1; 3-2015; 187-2001365-8050CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/download/2546/4672.pdfinfo:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-11-05T09:35:04Zoai:ri.conicet.gov.ar:11336/21313instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-11-05 09:35:04.338CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv On probe 2-clique graphs and probe diamond-free graphs
title On probe 2-clique graphs and probe diamond-free graphs
spellingShingle On probe 2-clique graphs and probe diamond-free graphs
Bonomo, Flavia
2-Clique Graphs
Diamond-Free Graphs
Probe Graphs
title_short On probe 2-clique graphs and probe diamond-free graphs
title_full On probe 2-clique graphs and probe diamond-free graphs
title_fullStr On probe 2-clique graphs and probe diamond-free graphs
title_full_unstemmed On probe 2-clique graphs and probe diamond-free graphs
title_sort On probe 2-clique graphs and probe diamond-free graphs
dc.creator.none.fl_str_mv Bonomo, Flavia
Figueiredo, Celina M. H. de
Duran, Guillermo Alfredo
Grippo, Luciano Norberto
Safe, Martin Dario
Szwarcfiter, Jayme L.
author Bonomo, Flavia
author_facet Bonomo, Flavia
Figueiredo, Celina M. H. de
Duran, Guillermo Alfredo
Grippo, Luciano Norberto
Safe, Martin Dario
Szwarcfiter, Jayme L.
author_role author
author2 Figueiredo, Celina M. H. de
Duran, Guillermo Alfredo
Grippo, Luciano Norberto
Safe, Martin Dario
Szwarcfiter, Jayme L.
author2_role author
author
author
author
author
dc.subject.none.fl_str_mv 2-Clique Graphs
Diamond-Free Graphs
Probe Graphs
topic 2-Clique Graphs
Diamond-Free Graphs
Probe Graphs
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv 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.
Fil: Bonomo, Flavia. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Figueiredo, Celina M. H. de. Universidade Federal do Rio de Janeiro; Brasil
Fil: Duran, Guillermo Alfredo. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina. Universidad de Chile; Chile. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Grippo, Luciano Norberto. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Safe, Martin Dario. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Szwarcfiter, Jayme L.. Universidade Federal do Rio de Janeiro; Brasil
description 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.
publishDate 2015
dc.date.none.fl_str_mv 2015-03
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/21313
Bonomo, Flavia; Figueiredo, Celina M. H. de; Duran, Guillermo Alfredo; Grippo, Luciano Norberto; Safe, Martin Dario; et al.; On probe 2-clique graphs and probe diamond-free graphs; Chapman & Hall; Discrete Mathematics and Theoretical Computer Science; 17; 1; 3-2015; 187-200
1365-8050
CONICET Digital
CONICET
url http://hdl.handle.net/11336/21313
identifier_str_mv Bonomo, Flavia; Figueiredo, Celina M. H. de; Duran, Guillermo Alfredo; Grippo, Luciano Norberto; Safe, Martin Dario; et al.; On probe 2-clique graphs and probe diamond-free graphs; Chapman & Hall; Discrete Mathematics and Theoretical Computer Science; 17; 1; 3-2015; 187-200
1365-8050
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/download/2546/4672.pdf
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Chapman & Hall
publisher.none.fl_str_mv Chapman & Hall
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1847976768004161536
score 13.087074

Publicaciones similares