Mostra el registre d'ítem simple
On large (delta, D, D, 1)-graphs
dc.contributor.author | Gómez Martí, José |
dc.contributor.author | Fàbrega Canudas, José |
dc.contributor.author | Andrés Yebra, José Luis |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV |
dc.date.accessioned | 2011-09-22T13:16:38Z |
dc.date.available | 2011-09-22T13:16:38Z |
dc.date.created | 2011-07 |
dc.date.issued | 2011-07 |
dc.identifier.citation | Gomez, J.; Fàbrega, J.; Andrés, J. On large (delta, D, D, 1)-graphs. "Networks", Juliol 2011, vol. 57, núm. 4, p. 316-327. |
dc.identifier.issn | 0028-3045 |
dc.identifier.uri | http://hdl.handle.net/2117/13303 |
dc.description.abstract | Concern about fault tolerance in the design of interconnection networks has aroused interest in finding large graphs such that the subgraphs obtained by deleting any set of up to s vertices have small diameter. Clearly, 1 ≤ S ≤ Δ− 1, where Δ is the maximum degree of the graph. Graphs of maximum degree Δ, diameter ≤ D and such that the graphs obtained by deletion of up to s vertices have diameter ≤ D' are known as (Δ,D,D',s)-graphs. This article considers the case S = 1 and D = D'. In other words, it deals with the search for large graphs whose diameter does not increase after deleting one vertex. The article also contains an updated table of the largest known (Δ,D,D,1)-graphs, in which most of the entries correspond to the constructions put forward in this article. |
dc.format.extent | 12 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica aplicada a les ciències |
dc.subject.lcsh | Interconnection networks |
dc.subject.lcsh | Large graphs |
dc.subject.lcsh | Compound graphs |
dc.subject.lcsh | Product of graphs |
dc.subject.lcsh | Vulnerability |
dc.subject.lcsh | (Δ,D,D', s)-problem |
dc.title | On large (delta, D, D, 1)-graphs |
dc.type | Article |
dc.subject.lemac | Grafs, Teoria de -- Informàtica |
dc.contributor.group | Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
dc.identifier.doi | 10.1002/net.20401 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | http://onlinelibrary.wiley.com/doi/10.1002/net.20401/abstract |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 5893295 |
dc.description.version | Postprint (published version) |
local.citation.author | Gomez, J.; Fàbrega, J.; Andrés, J. |
local.citation.publicationName | Networks |
local.citation.volume | 57 |
local.citation.number | 4 |
local.citation.startingPage | 316 |
local.citation.endingPage | 327 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [3.267]
-
Articles de revista [290]