| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Wide diameter of Cartesian graph bundles
Authors:ID Banič, Iztok (Author)
ID Žerovnik, Janez (Author)
Files:URL http://dx.doi.org/10.1016/j.disc.2009.11.024
 
Language:English
Work type:Article
Typology:1.08 - Published Scientific Conference Contribution
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:Fault tolerance and transmission delay of networks are important concepts in network design. The notions are strongly related to connectivity and diameter of a graph, and have been studied by many authors. Wide diameter of a graph combines studying connectivity with the diameter of a graph. Diameter with width ▫$k$▫ of a graph ▫$G$▫, ▫$k$▫-diameter, is defined as the minimum integer ▫$d$▫ for which there exist at least ▫$k$▫ internally disjoint paths of length at most ▫$d$▫ between any two distinct vertices in ▫$G$▫. Denote by ▫${mathscr D}_c(G)$▫ the ▫$c$▫-diameter of ▫$G$▫ and ▫$kappa(G)$▫ the connectivity of ▫$G$▫. In the context of computer networks, wide diameters of Cartesian graph products have been recently studied by many authors. Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph products. Let ▫$G$▫ be a Cartesian graph bundle with fiber ▫$F$▫ over base ▫$B$▫, ▫$0 < a le kappa(F)$▫, and ▫$0 < b le kappa(B)$▫. We prove that ▫${mathscr D}_{a+b}(G) le {mathscr D}_a(F) + {mathscr D}_b(B) + 1$▫. Moreover, if ▫$G$▫ is a graph bundle with fiber ▫$F ne K_2$▫ over base ▫$B ne K_2$▫, then ▫${mathscr D}_{a+b}(G) le {mathscr D}_a(F) + {mathscr D}_b(B)$▫. The bounds are tight.
Keywords:mathematics, graph theory, Cartesian graph products, Cartesian graph bundles, wide diameter
Year of publishing:2010
PID:20.500.12556/DKUM-35459 New window
UDC:519.17
ISSN on article:0012-365X
COBISS.SI-ID:17543176 New window
NUK URN:URN:SI:UM:DK:OLXAAPZ0
Publication date in DKUM:07.06.2012
Views:2265
Downloads:98
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



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

Record is a part of a journal

Title:Discrete mathematics
Shortened title:Discrete math.
Publisher:North-Holland
ISSN:0012-365X
COBISS.SI-ID:1118479 New window

Secondary language

Language:Slovenian
Keywords:matematika, teorija grafov, kartezični grafovski produkti, kartezični grafovski svežnji


Comments

Leave comment

You must 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