| Title: | Edge, vertex and mixed fault diameters |
|---|
| Authors: | ID Banič, Iztok (Author)
ID Erveš, Rija (Author)
ID Žerovnik, Janez (Author) |
|---|
| Files: |  http://dx.doi.org/10.1016/j.aam.2009.01.005
|
|---|
| Language: | English |
|---|
| Work type: | Article |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | FNM - Faculty of Natural Sciences and Mathematics
|
|---|
| Abstract: | Let ▫${mathcal{D}}^E_q(G)$▫ denote the maximum diameter among all subgraphs obtained by deleting ▫$q$▫ edges of ▫$G$▫. Let ▫${mathcal{D}}^V_p(G)$▫ denote the maximum diameter among all subgraphs obtained by deleting ▫$p$▫ vertices of ▫$G$▫. We prove that ▫${mathcal{D}}^E_a(G) leqslant {mathcal{D}}^V_a(G) + 1$▫ a for all meaningful ▫$a$▫. We also define mixed fault diameter ▫${mathcal{D}}^M_{(p,q)}(G)$▫, where ▫$p$▫ vertices and ▫$q$▫ edges are deleted at the same time. We prove that for ▫$0 < l leqslant a$▫, ▫${mathcal{D}}^E_a(G) leqslant {mathcal{D}}^M_{(a-ell,ell)}(G) leqslant {mathcal{D}}^V_a(G) + 1$▫, and give some examples. |
|---|
| Keywords: | vertex-connectivity, edge-connectivity, vertex fault diameter, edge fault diameter, mixed fault diameter, interconnection network |
|---|
| Year of publishing: | 2009 |
|---|
| Number of pages: | str. 231-238 |
|---|
| Numbering: | Vol. 43, iss. 3 |
|---|
| PID: | 20.500.12556/DKUM-51487  |
|---|
| UDC: | 519.17 |
|---|
| ISSN on article: | 0196-8858 |
|---|
| COBISS.SI-ID: | 13396502 |
|---|
| DOI: | 10.1016/j.aam.2009.01.005 |
|---|
| NUK URN: | URN:SI:UM:DK:8XGKAGIF |
|---|
| Publication date in DKUM: | 10.07.2015 |
|---|
| Views: | 1536 |
|---|
| Downloads: | 107 |
|---|
| Metadata: |    |
|---|
| Categories: | Misc.
|
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
