| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Izpis gradiva Pomoč

Naslov:Wide diameter of Cartesian graph bundles
Avtorji:ID Banič, Iztok (Avtor)
ID Žerovnik, Janez (Avtor)
Datoteke:URL http://dx.doi.org/10.1016/j.disc.2009.11.024
 
Jezik:Angleški jezik
Vrsta gradiva:Članek v reviji
Tipologija:1.08 - Objavljeni znanstveni prispevek na konferenci
Organizacija:FNM - Fakulteta za naravoslovje in matematiko
Opis: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.
Ključne besede:mathematics, graph theory, Cartesian graph products, Cartesian graph bundles, wide diameter
Leto izida:2010
PID:20.500.12556/DKUM-35459 Novo okno
UDK:519.17
COBISS.SI-ID:17543176 Novo okno
ISSN pri članku:0012-365X
NUK URN:URN:SI:UM:DK:OLXAAPZ0
Datum objave v DKUM:07.06.2012
Število ogledov:2263
Število prenosov:98
Metapodatki:XML DC-XML DC-RDF
Področja:Ostalo
:
Kopiraj citat
  
Skupna ocena:(0 glasov)
Vaša ocena:Ocenjevanje je dovoljeno samo prijavljenim uporabnikom.
Objavi na:Bookmark and Share



Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše podrobnosti ali sproži prenos.

Gradivo je del revije

Naslov:Discrete mathematics
Skrajšan naslov:Discrete math.
Založnik:North-Holland
ISSN:0012-365X
COBISS.SI-ID:1118479 Novo okno

Sekundarni jezik

Jezik:Slovenski jezik
Ključne besede:matematika, teorija grafov, kartezični grafovski produkti, kartezični grafovski svežnji


Komentarji

Dodaj komentar

Za komentiranje se morate prijaviti.

Komentarji (0)
0 - 0 / 0
 
Ni komentarjev!

Nazaj
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici