Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/11260
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kwancharone, S. | - |
dc.contributor.author | Saenpholphat, V. | - |
dc.contributor.author | Fonseca, C. M. da | - |
dc.date.accessioned | 2009-08-31T13:20:13Z | - |
dc.date.available | 2009-08-31T13:20:13Z | - |
dc.date.issued | 2008 | - |
dc.identifier.citation | Pré-Publicações DMUC. 08-17 (2008) | en_US |
dc.identifier.uri | https://hdl.handle.net/10316/11260 | - |
dc.description.abstract | For an ordered set W = {w1,w2, · · · ,wk} of vertices in a connected graph G and a vertex v of G, the code of v with respect to W is the k-vector CW(v) = (d(v,w1), d(v,w2), · · · , d(v,wk)). The set W is a one size resolving set for G if (1) the size of subgraph hWi induced by W is one and (2) distinct vertices of G have distinct code with respect to W. The minimum cardinality of a one size resolving set in graph G is the one size resolving number, denoted by or(G). A one size resolving set of cardinality or(G) is called an or-set of G. We study the existence of or-set in graphs and characterize all nontrivial connected graphs G of order n with or(G) = n and n − 1. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Centro de Matemática da Universidade de Coimbra | en_US |
dc.rights | openAccess | eng |
dc.subject | Resolving set | en_US |
dc.subject | One size resolving set | en_US |
dc.title | One size resolvability of graphs | en_US |
dc.type | preprint | en_US |
item.openairecristype | http://purl.org/coar/resource_type/c_816b | - |
item.openairetype | preprint | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | open | - |
item.fulltext | Com Texto completo | - |
item.languageiso639-1 | en | - |
Appears in Collections: | FCTUC Matemática - Vários |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
One size resolvability of graphs.pdf | 117.55 kB | Adobe PDF | View/Open |
Page view(s) 50
474
checked on Apr 23, 2024
Download(s)
58
checked on Apr 23, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.