Powers of cycles, powers of paths, and distance graphs

Autores
Lin, Min Chih; Rautenbach, Dieter; Soulignac, Francisco Juan; Szwarcfiter, Jayme Luiz
Año de publicación
2011
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
In 1988, Golumbic and Hammer characterized the powers of cycles, relating them to circular arc graphs. We extend their results and propose several further structural characterizations for both powers of cycles and powers of paths. The characterizations lead to linear-time recognition algorithms of these classes of graphs. Furthermore, as a generalization of powers of cycles, powers of paths, and even of the well-known circulant graphs, we consider distance graphs. While the colorings of these graphs have been intensively studied, the recognition problem has been so far neglected. We propose polynomial-time recognition algorithms for these graphs under additional restrictions.
Fil: Lin, Min Chih. 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: Rautenbach, Dieter. Technische Universität Ilmenau; Alemania
Fil: Soulignac, Francisco Juan. 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: Szwarcfiter, Jayme Luiz. Universidade Federal do Rio de Janeiro; Brasil
Materia
Circulant Graph
Circular Arc Graph
Cycle
Distance Graph
Interval Graph
Path
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-nd/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/68005
Acceder
id CONICETDig_58b9e46d8ff71b9099ebc2e2eda32ec8
oai_identifier_str oai:ri.conicet.gov.ar:11336/68005
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Powers of cycles, powers of paths, and distance graphsLin, Min ChihRautenbach, DieterSoulignac, Francisco JuanSzwarcfiter, Jayme LuizCirculant GraphCircular Arc GraphCycleDistance GraphInterval GraphPathhttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1In 1988, Golumbic and Hammer characterized the powers of cycles, relating them to circular arc graphs. We extend their results and propose several further structural characterizations for both powers of cycles and powers of paths. The characterizations lead to linear-time recognition algorithms of these classes of graphs. Furthermore, as a generalization of powers of cycles, powers of paths, and even of the well-known circulant graphs, we consider distance graphs. While the colorings of these graphs have been intensively studied, the recognition problem has been so far neglected. We propose polynomial-time recognition algorithms for these graphs under additional restrictions.Fil: Lin, Min Chih. 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: Rautenbach, Dieter. Technische Universität Ilmenau; AlemaniaFil: Soulignac, Francisco Juan. 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: Szwarcfiter, Jayme Luiz. Universidade Federal do Rio de Janeiro; BrasilElsevier Science2011-04info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/68005Lin, Min Chih; Rautenbach, Dieter; Soulignac, Francisco Juan; Szwarcfiter, Jayme Luiz; Powers of cycles, powers of paths, and distance graphs; Elsevier Science; Discrete Applied Mathematics; 159; 7; 4-2011; 621-6270166-218XCONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2010.03.012info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0166218X10001186info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-nd/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-03T09:47:30Zoai:ri.conicet.gov.ar:11336/68005instacron: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-09-03 09:47:30.999CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Powers of cycles, powers of paths, and distance graphs
title Powers of cycles, powers of paths, and distance graphs
spellingShingle Powers of cycles, powers of paths, and distance graphs
Lin, Min Chih
Circulant Graph
Circular Arc Graph
Cycle
Distance Graph
Interval Graph
Path
title_short Powers of cycles, powers of paths, and distance graphs
title_full Powers of cycles, powers of paths, and distance graphs
title_fullStr Powers of cycles, powers of paths, and distance graphs
title_full_unstemmed Powers of cycles, powers of paths, and distance graphs
title_sort Powers of cycles, powers of paths, and distance graphs
dc.creator.none.fl_str_mv Lin, Min Chih
Rautenbach, Dieter
Soulignac, Francisco Juan
Szwarcfiter, Jayme Luiz
author Lin, Min Chih
author_facet Lin, Min Chih
Rautenbach, Dieter
Soulignac, Francisco Juan
Szwarcfiter, Jayme Luiz
author_role author
author2 Rautenbach, Dieter
Soulignac, Francisco Juan
Szwarcfiter, Jayme Luiz
author2_role author
author
author
dc.subject.none.fl_str_mv Circulant Graph
Circular Arc Graph
Cycle
Distance Graph
Interval Graph
Path
topic Circulant Graph
Circular Arc Graph
Cycle
Distance Graph
Interval Graph
Path
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv In 1988, Golumbic and Hammer characterized the powers of cycles, relating them to circular arc graphs. We extend their results and propose several further structural characterizations for both powers of cycles and powers of paths. The characterizations lead to linear-time recognition algorithms of these classes of graphs. Furthermore, as a generalization of powers of cycles, powers of paths, and even of the well-known circulant graphs, we consider distance graphs. While the colorings of these graphs have been intensively studied, the recognition problem has been so far neglected. We propose polynomial-time recognition algorithms for these graphs under additional restrictions.
Fil: Lin, Min Chih. 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: Rautenbach, Dieter. Technische Universität Ilmenau; Alemania
Fil: Soulignac, Francisco Juan. 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: Szwarcfiter, Jayme Luiz. Universidade Federal do Rio de Janeiro; Brasil
description In 1988, Golumbic and Hammer characterized the powers of cycles, relating them to circular arc graphs. We extend their results and propose several further structural characterizations for both powers of cycles and powers of paths. The characterizations lead to linear-time recognition algorithms of these classes of graphs. Furthermore, as a generalization of powers of cycles, powers of paths, and even of the well-known circulant graphs, we consider distance graphs. While the colorings of these graphs have been intensively studied, the recognition problem has been so far neglected. We propose polynomial-time recognition algorithms for these graphs under additional restrictions.
publishDate 2011
dc.date.none.fl_str_mv 2011-04
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/68005
Lin, Min Chih; Rautenbach, Dieter; Soulignac, Francisco Juan; Szwarcfiter, Jayme Luiz; Powers of cycles, powers of paths, and distance graphs; Elsevier Science; Discrete Applied Mathematics; 159; 7; 4-2011; 621-627
0166-218X
CONICET Digital
CONICET
url http://hdl.handle.net/11336/68005
identifier_str_mv Lin, Min Chih; Rautenbach, Dieter; Soulignac, Francisco Juan; Szwarcfiter, Jayme Luiz; Powers of cycles, powers of paths, and distance graphs; Elsevier Science; Discrete Applied Mathematics; 159; 7; 4-2011; 621-627
0166-218X
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2010.03.012
info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0166218X10001186
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier Science
publisher.none.fl_str_mv Elsevier Science
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_ 1842268863830425600
score 13.13397

Publicaciones similares