| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document

Title:Edge, vertex and mixed fault-diameters
Authors:Banič, Iztok (Author)
Erveš, Rija (Author)
Žerovnik, Janez (Author)
Files:URL http://www.imfm.si/preprinti/PDF/01058.pdf
 
Language:English
Work type:Not categorized (r6)
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
ISSN:1318-4865
UDC:519.17
COBISS_ID:14912345 Link is opened in a new window
NUK URN:URN:SI:UM:DK:UNCFPTVE
Views:438
Downloads:57
Metadata:XML RDF-CHPDL DC-XML DC-RDF
Categories:Misc.
:
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:AddThis
AddThis uses cookies that require your consent. Edit consent...

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Comments

Leave comment

You have to log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica