| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document

Title:Dekompozicija kartezičnega produkta regularnih grafov v izomorfna drevesa
Authors:Maučec, Gregor (Author)
Jerebic, Janja (Mentor) More about this mentor... New window
Files:.pdf UN_Maucec_Gregor_2016.pdf (514,84 KB)
MD5: 18BAB6E7FC0D4F5B07EEBEFDA237742A
 
Language:Slovenian
Work type:Undergraduate thesis (m5)
Typology:2.11 - Undergraduate Thesis
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:Diplomsko delo obravnava družine 2m-regularnih grafov in m-regularnih dvodelnih grafov, ki se dekomponirajo v izomorfne kopije drevesa T z m povezavami. Obravnavana je k-terica r1,..., rk z vsoto i=1 do k ri = m. Za drevo T s takim k-barvanjem po povezavah z r i povezavami barve i, da ima vsaka pot v T eno ali dve povezavi iste barve, je predstavljen rezultat, da se vsak kartezični produkt grafov G1,...,Gk, kjerje Gi 2ri-regularen graf za 1 <= i <= k, dekomponira v kopije drevesa T.
Keywords:dekompozicijski izrek, dobro barvanje, drevesa, kartezični produkt
Year of publishing:2016
Publisher:[G. Maučec]
Source:Maribor
UDC:519.174(043.2)
COBISS_ID:22722568 New window
NUK URN:URN:SI:UM:DK:LCB0Y9KQ
Views:630
Downloads:37
Metadata:XML RDF-CHPDL DC-XML DC-RDF
Categories:FNM
:
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:AddThis
AddThis uses cookies that require your consent. Edit consent...

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

Secondary language

Language:English
Title:Decomposition of cartesian products of regular graphs into isomorphic trees
Abstract:The diploma paper discesses the families of 2m-regular graphs and m-regular bipartite graphs that are known to decompose into isomorphic copies of a tree T with m edges. A k-tuple r1,...,rk with i=1 k ri=m. Is considered k-edge-coloring with ri edges of color i, such that every path in T use some color once or twice. For a tree containing the result that every cartesian product of graphs G1,..., Gk, such that Gi is 2ri-regular for 1 <= i <= k, decomposes into copies of T is presented.
Keywords:decomposition theorem, edge-colorings, trees, Cartesian product


Comments

Leave comment

You have to 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