20.500.12556/DKUM-51487 Edge, vertex and mixed fault diameters 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. vertex-connectivity edge-connectivity vertex fault diameter edge fault diameter mixed fault diameter interconnection network teorija grafov povezanost po točkah povezanost po povezavah povezavni okvarni premer točkovni okvarni premer mešani okvarni premer povezovalna mreža true true false Angleški jezik Slovenski jezik Članek v reviji 2015-07-10 14:51:12 2015-07-10 14:51:12 2024-03-15 14:44:07 2019-07-11 07:20:24 2009 0 0 str. 231-238 iss. 3 Vol. 43 2009 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 519.17 24885504 13396502 10.1016/j.aam.2009.01.005 0196-8858 URN:SI:UM:DK:8XGKAGIF http://dx.doi.org/10.1016/j.aam.2009.01.005 1 https://dk.um.si/Dokument.php?lang=slv&id=76047 Fakulteta za naravoslovje in matematiko 0 0 0