| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:On domination numbers of graph bundles
Authors:ID Zmazek, Blaž (Author)
ID Žerovnik, Janez (Author)
Files:URL http://www.imfm.si/preprinti/PDF/00998.pdf
 
Language:English
Work type:Not categorized
Organization:PEF - Faculty of Education
Abstract:Let ▫$gamma(G)$▫ be the domination number of a graph ▫$G$▫. It is shown that for any ▫$k ge 0$▫ there exists a Cartesian graph bundle ▫$B Box_varphi F$▫ such that ▫$gamma(B Box_varphi F) = gamma(B)gamma(F) - 2k$▫. The domination numbers of Cartesian bundles of two cycles are determined exactly when the fibre graph is a triangle or a square. A statement similar to Vizing's conjecture on strong graph bundles is shown not to be true by proving the inequality ▫$gamma(B boxtimes_varphi F) le gamma(B)gamma(F)$▫ for strong graph bundles. Examples of graphs ▫$B$▫ and ▫$F$▫ with ▫$gamma(B boxtimes_varphi F) < gamma(B)gamma(F)$▫ are given.
Keywords:matematika, teorija grafov, kartezični produkt grafov, dominantno število, dominantna množica, grafovski sveženj, mathematics, graph theory, graph bundle, dominating set, domination number, Cartesian product
Year of publishing:2005
Number of pages:str. 1-10
Numbering:Vol. 43, št. 998
PID:20.500.12556/DKUM-49374 New window
ISSN:1318-4865
UDC:519.17
COBISS.SI-ID:13826905 New window
NUK URN:URN:SI:UM:DK:QLKY20QT
Publication date in DKUM:10.07.2015
Views:1817
Downloads:114
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.

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