On the L(2,1)-labeling of block graphs | ||
| dc.conicet.organizacion | Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación | |
| dc.conicet.organizacion | Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigaciones Matemáticas "Luis A. Santaló" | |
| dc.conicet.organizacion | Universidade Federal do Rio de Janeiro | |
| dc.contributor.author | Bonomo, Flavia | |
| dc.contributor.author | Cerioli, Marcia R. | |
| dc.date.issued | 2011-02 | |
| dc.description.abstract | 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. | es |
| dc.description.fil | 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 | |
| dc.description.fil | Fil: Cerioli, Marcia R.. Universidade Federal do Rio de Janeiro; Brasil | |
| dc.format | application/pdf | es |
| dc.identifier.citation | 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 | es |
| dc.identifier.issn | 0020-7160 | |
| dc.identifier.uri | http://hdl.handle.net/11336/14908 | |
| dc.journal.number | 3 | es |
| dc.journal.pagination | 468-475 | es |
| dc.journal.pais | Reino Unido | es |
| dc.journal.title | International Journal Of Computer Mathematics | es |
| dc.journal.volume | 88 | es |
| dc.language.iso | eng | es |
| dc.publisher | Taylor & Francis Ltd | es |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1080/00207161003650075 | |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/url/http://www.tandfonline.com/doi/abs/10.1080/00207161003650075?journalCode=gcom20 | |
| dc.rights | info:eu-repo/semantics/openAccess | * |
| dc.rights.uri | https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | es |
| dc.subject | Block Graphs | es |
| dc.subject | Distance-Two Labelling Problem | es |
| dc.subject | Graph Colouring | es |
| dc.subject.classification | Matemática Aplicada | es |
| dc.subject.classification | Matemáticas | es |
| dc.subject.classification | CIENCIAS NATURALES Y EXACTAS | es |
| dc.title | On the L(2,1)-labeling of block graphs | es |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:ar-repo/semantics/artículo | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
Archivos
Bloque original
Cargando...
- Nombre:
- CONICET_Digital_Nro.18295.pdf
- Tamaño:
- 242.96 KB
- Formato:
- Adobe Portable Document Format