Diameter vulnerability of iterated line digraphs
Identifieur interne : 005845 ( Main/Merge ); précédent : 005844; suivant : 005846Diameter vulnerability of iterated line digraphs
Auteurs : C. Padr [Espagne] ; P. Morillo [Espagne]Source :
- Discrete Mathematics [ 0012-365X ] ; 1993.
Abstract
Because of their good properties, iterated line digraphs (specially Kautz and de Bruijn digraphs) have been considered to design interconnection networks. The diameter-vulnerability of a digraph is the maximum diameter of the subdigraphs obtained by deleting a fixed number of vertices or arcs. For any digraph G, we find a constant C (not greater than twice the diameter of G) such that, under certain conditions, the diameter vulnerability of the iterated line digraph Lk G is at most the diameter of Lk G plus C. The results in this paper generalize previous results on the diameter-vulnerability of particular families of iterated line digraphs (Kautz and de Bruijn digraphs).
Url:
DOI: 10.1016/0012-365X(96)83094-9
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003B63
- to stream Istex, to step Curation: 003B63
- to stream Istex, to step Checkpoint: 003E43
Links to Exploration step
ISTEX:58556E30991C3099220FC20A739F585A90AD8CC6Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>Diameter vulnerability of iterated line digraphs</title><author><name sortKey="Padr, C" sort="Padr, C" uniqKey="Padr C" first="C." last="Padr">C. Padr</name></author><author><name sortKey="Morillo, P" sort="Morillo, P" uniqKey="Morillo P" first="P." last="Morillo">P. Morillo</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:58556E30991C3099220FC20A739F585A90AD8CC6</idno><date when="1996" year="1996">1996</date><idno type="doi">10.1016/0012-365X(96)83094-9</idno><idno type="url">https://api.istex.fr/document/58556E30991C3099220FC20A739F585A90AD8CC6/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">003B63</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003B63</idno><idno type="wicri:Area/Istex/Curation">003B63</idno><idno type="wicri:Area/Istex/Checkpoint">003E43</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">003E43</idno><idno type="wicri:doubleKey">0012-365X:1996:Padr C:diameter:vulnerability:of</idno><idno type="wicri:Area/Main/Merge">005845</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">Diameter vulnerability of iterated line digraphs</title><author><name sortKey="Padr, C" sort="Padr, C" uniqKey="Padr C" first="C." last="Padr">C. Padr</name><affiliation wicri:level="2"><country xml:lang="fr">Espagne</country><wicri:regionArea>Departament de Matemàtica Aplicada i Telematica, Universitat Politècnica de Catalunya, C/Gran Capità s/n, 08034 Barcelona</wicri:regionArea><placeName><region nuts="2" type="communauté">Catalogne</region></placeName></affiliation></author><author><name sortKey="Morillo, P" sort="Morillo, P" uniqKey="Morillo P" first="P." last="Morillo">P. Morillo</name><affiliation wicri:level="2"><country xml:lang="fr">Espagne</country><wicri:regionArea>Departament de Matemàtica Aplicada i Telematica, Universitat Politècnica de Catalunya, C/Gran Capità s/n, 08034 Barcelona</wicri:regionArea><placeName><region nuts="2" type="communauté">Catalogne</region></placeName></affiliation></author></analytic><monogr></monogr><series><title level="j">Discrete Mathematics</title><title level="j" type="abbrev">DISC</title><idno type="ISSN">0012-365X</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1993">1993</date><biblScope unit="volume">149</biblScope><biblScope unit="issue">1–3</biblScope><biblScope unit="page" from="189">189</biblScope><biblScope unit="page" to="204">204</biblScope></imprint><idno type="ISSN">0012-365X</idno></series><idno type="istex">58556E30991C3099220FC20A739F585A90AD8CC6</idno><idno type="DOI">10.1016/0012-365X(96)83094-9</idno><idno type="PII">0012-365X(96)83094-9</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0012-365X</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Because of their good properties, iterated line digraphs (specially Kautz and de Bruijn digraphs) have been considered to design interconnection networks. The diameter-vulnerability of a digraph is the maximum diameter of the subdigraphs obtained by deleting a fixed number of vertices or arcs. For any digraph G, we find a constant C (not greater than twice the diameter of G) such that, under certain conditions, the diameter vulnerability of the iterated line digraph Lk G is at most the diameter of Lk G plus C. The results in this paper generalize previous results on the diameter-vulnerability of particular families of iterated line digraphs (Kautz and de Bruijn digraphs).</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/TelematiV1/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 005845 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 005845 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= TelematiV1
|flux= Main
|étape= Merge
|type= RBID
|clé= ISTEX:58556E30991C3099220FC20A739F585A90AD8CC6
|texte= Diameter vulnerability of iterated line digraphs
}}
| This area was generated with Dilib version V0.6.31. |  |