| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:The edge fault-diameter of Cartesian graph bundles
Authors:ID Banič, Iztok (Author)
ID Erveš, Rija (Author)
ID Žerovnik, Janez (Author)
Files:URL http://dx.doi.org/10.1016/j.ejc.2008.09.004
 
Language:English
Work type:Not categorized
Typology:1.01 - Original Scientific Article
Organization:FS - Faculty of Mechanical Engineering
Abstract:Kartezični svežnji so posplošitev krovnih grafov in kartezičnih grafovskih produktov. Naj bo ▫$G$▫ nek s povezavami ▫$k_G$▫-povezan graf in ▫${bar{mathcal{D}}_c(G)}$▫ največji premer podgrafov grafa ▫$G$▫ dobljenih z odstranitvijo $▫c < k_G$▫ povezav. Dokazano je, da je ▫${bar{mathcal{D}}_{a+b+1}(G)} le {bar{mathcal{D}}_a(F)} le {bar{mathcal{D}}_b(B)} + 1$▫, če je ▫$G$▫ grafovski sveženj z vlaknom ▫$F$▫ in bazo ▫$B$▫, ▫$a < k_F$▫, ▫$b < k_B▫$. Dokazano je tudi, da je povezanost s povezavami grafovskega svežnja ▫$G▫$ vsaj ▫$k_F + k_B$▫.
Keywords:matematika, teorija grafov, kartezični grafovski produkti, kartezični grafovski svežnji, povezavni okvarni premer, mathematics, graph theory, Cartesian graph products, Cartesian graph bundles, edge-fault diameter
Year of publishing:2009
Number of pages:str. 1054-1061
Numbering:Vol. 30, no. 5
PID:20.500.12556/DKUM-51787 New window
UDC:519.17
ISSN on article:0195-6698
COBISS.SI-ID:15145817 New window
NUK URN:URN:SI:UM:DK:UQQDEVTB
Publication date in DKUM:10.07.2015
Views:1694
Downloads:97
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:European journal of combinatorics
Shortened title:Eur. j. comb.
Publisher:Academic Press
ISSN:0195-6698
COBISS.SI-ID:25427968 New window

Secondary language

Language:Unknown
Title:Povezavni okvarni premer kartezičnih svežnjev
Abstract:A Cartesian graph bundle is a generalization of a graph covering and a Cartesian graph product. Let ▫$G$▫ be a ▫$k_G$▫-edge connected graph and ▫${bar{mathcal{D}}_c(G)}$▫ be the largest diameter of subgraphs of ▫$G$▫ obtained by deleting ▫$c < k_G$▫ edges. We prove that ▫${bar{mathcal{D}}_{a+b+1}(G)} le {bar{mathcal{D}}_a(F)} le {bar{mathcal{D}}_b(B)} + 1$▫ if ▫$G$▫ is a graph bundle with fibre ▫$F$▫ over base $B$, ▫$a < k_F$▫, and ▫$b<k_B$▫. As an auxiliary result we prove that the edge-connectivity of graph bundle ▫$G$▫ is at least ▫$k_F + k_B$▫.


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