On the L(2,1)-labeling of block graphs

Autores
Bonomo, Flavia; Cerioli, Marcia R.
Año de publicación
2011
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
The distance-two labelling problem of graphs was proposed by Griggs and Roberts in 1988, and it is a variation of the frequency assignment problem introduced by Hale in 1980. An L(2, 1)-labelling of a graph G is an assignment of non-negative integers to the vertices of G such that vertices at distance two receive different numbers and adjacent vertices receive different and non-consecutive integers. The L(2, 1)-labelling number of G, denoted by λ(G), is the smallest integer k such that G has a L(2, 1)-labelling in which no label is greater than k.
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. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigaciones Matemáticas "Luis A. Santaló"; Argentina
Fil: Cerioli, Marcia R.. Universidade Federal do Rio de Janeiro; Brasil
Materia
Block Graphs
Distance-Two Labelling Problem
Graph Colouring
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/14908
Acceder
id CONICETDig_4a59820f21adb4b245f2f3e87fdd3c43
oai_identifier_str oai:ri.conicet.gov.ar:11336/14908
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling On the L(2,1)-labeling of block graphsBonomo, FlaviaCerioli, Marcia R.Block GraphsDistance-Two Labelling ProblemGraph Colouringhttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1The distance-two labelling problem of graphs was proposed by Griggs and Roberts in 1988, and it is a variation of the frequency assignment problem introduced by Hale in 1980. An L(2, 1)-labelling of a graph G is an assignment of non-negative integers to the vertices of G such that vertices at distance two receive different numbers and adjacent vertices receive different and non-consecutive integers. The L(2, 1)-labelling number of G, denoted by λ(G), is the smallest integer k such that G has a L(2, 1)-labelling in which no label is greater than k.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. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigaciones Matemáticas "Luis A. Santaló"; ArgentinaFil: Cerioli, Marcia R.. Universidade Federal do Rio de Janeiro; BrasilTaylor & Francis Ltd2011-02info: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/14908Bonomo, Flavia; Cerioli, Marcia R.; On the L(2,1)-labeling of block graphs; Taylor & Francis Ltd; International Journal Of Computer Mathematics; 88; 3; 2-2011; 468-4750020-7160enginfo:eu-repo/semantics/altIdentifier/doi/10.1080/00207161003650075info:eu-repo/semantics/altIdentifier/url/http://www.tandfonline.com/doi/abs/10.1080/00207161003650075?journalCode=gcom20info: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-12T09:40:22Zoai:ri.conicet.gov.ar:11336/14908instacron: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-12 09:40:22.813CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv On the L(2,1)-labeling of block graphs
title On the L(2,1)-labeling of block graphs
spellingShingle On the L(2,1)-labeling of block graphs
Bonomo, Flavia
Block Graphs
Distance-Two Labelling Problem
Graph Colouring
title_short On the L(2,1)-labeling of block graphs
title_full On the L(2,1)-labeling of block graphs
title_fullStr On the L(2,1)-labeling of block graphs
title_full_unstemmed On the L(2,1)-labeling of block graphs
title_sort On the L(2,1)-labeling of block graphs
dc.creator.none.fl_str_mv Bonomo, Flavia
Cerioli, Marcia R.
author Bonomo, Flavia
author_facet Bonomo, Flavia
Cerioli, Marcia R.
author_role author
author2 Cerioli, Marcia R.
author2_role author
dc.subject.none.fl_str_mv Block Graphs
Distance-Two Labelling Problem
Graph Colouring
topic Block Graphs
Distance-Two Labelling Problem
Graph Colouring
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv The distance-two labelling problem of graphs was proposed by Griggs and Roberts in 1988, and it is a variation of the frequency assignment problem introduced by Hale in 1980. An L(2, 1)-labelling of a graph G is an assignment of non-negative integers to the vertices of G such that vertices at distance two receive different numbers and adjacent vertices receive different and non-consecutive integers. The L(2, 1)-labelling number of G, denoted by λ(G), is the smallest integer k such that G has a L(2, 1)-labelling in which no label is greater than k.
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. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigaciones Matemáticas "Luis A. Santaló"; Argentina
Fil: Cerioli, Marcia R.. Universidade Federal do Rio de Janeiro; Brasil
description The distance-two labelling problem of graphs was proposed by Griggs and Roberts in 1988, and it is a variation of the frequency assignment problem introduced by Hale in 1980. An L(2, 1)-labelling of a graph G is an assignment of non-negative integers to the vertices of G such that vertices at distance two receive different numbers and adjacent vertices receive different and non-consecutive integers. The L(2, 1)-labelling number of G, denoted by λ(G), is the smallest integer k such that G has a L(2, 1)-labelling in which no label is greater than k.
publishDate 2011
dc.date.none.fl_str_mv 2011-02
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/14908
Bonomo, Flavia; Cerioli, Marcia R.; On the L(2,1)-labeling of block graphs; Taylor & Francis Ltd; International Journal Of Computer Mathematics; 88; 3; 2-2011; 468-475
0020-7160
url http://hdl.handle.net/11336/14908
identifier_str_mv Bonomo, Flavia; Cerioli, Marcia R.; On the L(2,1)-labeling of block graphs; Taylor & Francis Ltd; International Journal Of Computer Mathematics; 88; 3; 2-2011; 468-475
0020-7160
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1080/00207161003650075
info:eu-repo/semantics/altIdentifier/url/http://www.tandfonline.com/doi/abs/10.1080/00207161003650075?journalCode=gcom20
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 Taylor & Francis Ltd
publisher.none.fl_str_mv Taylor & Francis Ltd
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_ 1848597503836946432
score 13.24909

Publicaciones similares