Edge, vertex and mixed fault-diametersBanič, Iztok (Avtor) Erveš, Rija (Avtor) Žerovnik, Janez (Avtor) matematikateorija grafovpovezanostmathematics(vertex)-connectivityedge-connectivity(vertex) fault-diameteredge-fault diameterinterconnection networkLet ▫${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.20082015-07-10 12:01:10Delo ni kategorizirano49382ISSN: 1318-4865UDK: 519.17OceCobissID: 44310272COBISS_ID: 14912345NUK URN: URN:SI:UM:DK:UNCFPTVEsl