| Title: | Edge, vertex and mixed fault-diameters |
|---|
| Authors: | ID Banič, Iztok (Author)
ID Erveš, Rija (Author)
ID Žerovnik, Janez (Author) |
|---|
| Files: |  http://www.imfm.si/preprinti/PDF/01058.pdf
|
|---|
| Language: | English |
|---|
| Work type: | Not categorized |
|---|
| Organization: | FS - Faculty of Mechanical Engineering
|
|---|
| Abstract: | Let ▫${mathcal{D}}^E_q(G)$▫ denote the diameter of a graph ▫$G$▫ after deleting any of its ▫$q$▫ edges, and ▫${mathcal{D}}^V_p(G)$▫ denote the diameter of ▫$G$▫ after deleting any of its ▫$p$▫ vertices. We prove that ▫${mathcal{D}}^E_a(G) le {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 le a$▫, ▫${mathcal{D}}^E_a(G) le {mathcal{D}}^M_{(a-l,l)}(G) le {mathcal{D}}^V_a(G) + 1$▫, and give some examples. |
|---|
| Keywords: | matematika, teorija grafov, povezanost, mathematics, (vertex)-connectivity, edge-connectivity, (vertex) fault-diameter, edge-fault diameter, interconnection network |
|---|
| Year of publishing: | 2008 |
|---|
| Number of pages: | str. 1-10 |
|---|
| Numbering: | Vol. 46, št. 1058 |
|---|
| PID: | 20.500.12556/DKUM-49382  |
|---|
| ISSN: | 1318-4865 |
|---|
| UDC: | 519.17 |
|---|
| COBISS.SI-ID: | 14912345 |
|---|
| NUK URN: | URN:SI:UM:DK:UNCFPTVE |
|---|
| Publication date in DKUM: | 10.07.2015 |
|---|
| Views: | 1444 |
|---|
| Downloads: | 102 |
|---|
| 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. |
