Mostrar el registro sencillo del ítem
Artículo
The resolving number of a graph
dc.creator | Garijo Royo, Delia | |
dc.creator | González Herrera, Antonio | |
dc.creator | Márquez Pérez, Alberto | |
dc.date.accessioned | 2016-03-18T11:23:04Z | |
dc.date.available | 2016-03-18T11:23:04Z | |
dc.date.issued | 2013 | |
dc.identifier.uri | http://hdl.handle.net/11441/38826 | |
dc.description.abstract | We study a graph parameter related to resolving sets and metric dimension, namely the resolving number, introduced by Chartrand, Poisson and Zhang. First, we establish an important difference between the two parameters: while computing the metric dimension of an arbitrary graph is known to be NP-hard, we show that the resolving number can be computed in polynomial time. We then relate the resolving number to classical graph parameters: diameter, girth, clique number, order and maximum degree. With these relations in hand, we characterize the graphs with resolving number 3 extending other studies that provide characterizations for smaller resolving number. | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.relation.ispartof | Discrete Mathematics & Theoretical Computer Science 15(3): 155-166 (2013) | es |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.title | The resolving number of a graph | es |
dc.type | info:eu-repo/semantics/article | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.type.version | info:eu-repo/semantics/publishedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) | es |
dc.identifier.idus | https://idus.us.es/xmlui/handle/11441/38826 |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
The resolving number.pdf | 302.2Kb | [PDF] | Ver/ | |