| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:On the rainbow connection of Cartesian products and their subgraphs
Authors:ID Klavžar, Sandi (Author)
ID Mekiš, Gašper (Author)
Files:.pdf Discussiones_Mathematicae_Graph_Theory_2012_Klavzar,_Mekis_On_the_rainbow_connection_of_Cartesian_products_and_their_subgraphs.pdf (125,60 KB)
MD5: 08E030D2D9C851DDED1D3C0708735260
 
URL http://www.discuss.wmie.uz.zgora.pl/gt/index.php?doi=10.7151/dmgt.1644
 
Language:English
Work type:Scientific work
Typology:1.01 - Original Scientific Article
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:Rainbow connection number of Cartesian products and their subgraphs are considered. Previously known bounds are compared and non-existence of such bounds for subgraphs of products are discussed. It is shown that the rainbow connection number of an isometric subgraph of a hypercube is bounded above with the rainbow connection number of the hypercube. Isometric subgraphs of hypercubes with the rainbow connection number smaller as much as possible than the rainbow connection of the hypercube are constructed. The concept of c-strong rainbow coloring is introduced. In particular it is proved that the so-called ▫$\Theta$▫-coloring of an isometric subgraph of a hypercube is its unique optimal c-strong rainbow coloring.
Keywords:graph theory, rainbow connection, strong rainbow connection, Cartesian product of graphs, isometric subgraph, hypercube
Publication status:Published
Publication version:Version of Record
Submitted for review:08.06.2011
Article acceptance date:06.02.2012
Publisher:University of Zielona Góra
Year of publishing:2012
Number of pages:str. 783-793
Numbering:Letn. 32, št. 4
PID:20.500.12556/DKUM-65350 New window
ISSN:1234-3099
UDC:519.17
ISSN on article:1234-3099
COBISS.SI-ID:16417369 New window
NUK URN:URN:SI:UM:DK:5HDKVZY4
Publication date in DKUM:31.03.2017
Views:1365
Downloads:510
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:Discussiones mathematicae. Graph theory
Shortened title:Discuss. Math., Graph Theory
Publisher:Technical University Press
ISSN:1234-3099
COBISS.SI-ID:7487065 New window

Licences

License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.
Licensing start date:31.03.2017

Secondary language

Language:Slovenian
Title:O mavrični povezanosti kartezičnih produktov in njihovih podgrafov
Abstract:Obravnavana je mavrična povezanost kartezičnega produkta grafov in podgrafov tega produkta. Primerjane so že od prej znane meje in obravnavan je neobstoj takih mej za podgrafe produkta. Pokazano je, da je mavrična povezanost izometričnega podgrafa hiperkocke navzgor omejena z mavrično povezanostjo hiperkocke. Konstruirani so izometrični podgrafi hiperkocke s čim manjšo mavrično povezanostjo glede na mavrično povezanost hiperkocke. Vpeljan je pojem c-krepkega mavričnega barvanja. Dokazano je, da je t.i. ▫$\Theta$▫-barvanje izometričnega podgrafa hiperkocke edino optimalno c-krepko mavrično barvanje.
Keywords:teorija grafov, mavrična povezanost, krepka mavrična povezanost, kartezični produkt grafov, izometrični podgraf, hiperkocka


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