Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

57.066 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament de Matemàtiques
  • Reports de recerca
  • View Item
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament de Matemàtiques
  • Reports de recerca
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

The neighbor-locating-chromatic number of pseudotrees

Thumbnail
View/Open
XNL in pseudotrees Arxiv.pdf (376,2Kb)
Share:
 
  View Usage Statistics
Cita com:
hdl:2117/131569

Show full item record
Hernando Martín, María del CarmenMés informacióMés informacióMés informació
Mora Giné, MercèMés informacióMés informacióMés informació
Pelayo Melero, Ignacio ManuelMés informacióMés informacióMés informació
Gonzalez, Marisa
Alcón, Liliana
Document typeResearch report
Defense date2019-03-28
Rights accessOpen Access
Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain
Abstract
Ak-coloringof a graphGis a partition of the vertices ofGintokindependent sets,which are calledcolors. Ak-coloring isneighbor-locatingif any two vertices belongingto the same color can be distinguished from each other by the colors of their respectiveneighbors. Theneighbor-locating chromatic number¿NL(G) is the minimum cardinalityof a neighbor-locating coloring ofG.In this paper, we determine the neighbor-locating chromatic number of paths, cycles,fans and wheels. Moreover, a procedure to construct a neighbor-locating coloring ofminimum cardinality for these families of graphs is given. We also obtain tight upperbounds on the order of trees and unicyclic graphs in terms of the neighbor-locatingchromatic number. Further partial results for trees are also established.
CitationHernando, M. [et al.]. "The neighbor-locating-chromatic number of pseudotrees". 2019. 
URIhttp://hdl.handle.net/2117/131569
Collections
  • Departament de Matemàtiques - Reports de recerca [389]
Share:
 
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
XNL in pseudotrees Arxiv.pdf376,2KbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Contact Us
  • Send Feedback
  • Inici de la pàgina