| Title: | NZ-flows in strong products of graphs |
|---|
| Authors: | ID Imrich, Wilfried (Author)
ID Peterin, Iztok (Author)
ID Špacapan, Simon (Author)
ID Zhang, Cun-Quan (Author) |
|---|
| Files: |  http://dx.doi.org/10.1002/jgt.20455
|
|---|
| Language: | English |
|---|
| Work type: | Not categorized |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | FERI - Faculty of Electrical Engineering and Computer Science
|
|---|
| Abstract: | Za krepki produkt ▫$G_1 boxtimes G_2$▫ grafov ▫$G_1$▫ in ▫$G_2$▫ dokažemo, da je ▫${mathbb{Z}}_3$▫-pretočno kontraktibilen natanko tedaj, ko ▫$G_1 boxtimes G_2$▫ ni izomorfen ▫$Tboxtimes K_2$▫ (kar poimenujemo ▫$K_4$▫-drevo), kjer je ▫$T$▫ drevo. Sledi, da za ▫$G_1 boxtimes G_2$▫ obstaja NZ 3-pretok, razen če je ▫$G_1 boxtimes G_2$▫ ▫$K_4$▫-drevo. Dokaz je konstruktiven in implicira polinomski algoritem, ki nam vrne NZ 3-pretok, če ▫$G_1 boxtimes G_2$▫ ni ▫$K_4$▫-drevo, oziroma NZ 4-pretok sicer. |
|---|
| Keywords: | matematika, teorija grafov, celoštevilski pretoki, krepki produkt, poti, cikli, nikjer ničelni pretok, mathematics, graph theory, integer flows, strong product, paths, cycles |
|---|
| Year of publishing: | 2010 |
|---|
| Number of pages: | str. 267-276 |
|---|
| Numbering: | Vol. 64, iss. 4 |
|---|
| PID: | 20.500.12556/DKUM-51864  |
|---|
| UDC: | 519.17 |
|---|
| ISSN on article: | 0364-9024 |
|---|
| COBISS.SI-ID: | 15616089 |
|---|
| NUK URN: | URN:SI:UM:DK:AIHBFNKY |
|---|
| Publication date in DKUM: | 10.07.2015 |
|---|
| Views: | 1242 |
|---|
| Downloads: | 129 |
|---|
| Metadata: |    |
|---|
| Categories: | Misc.
|
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
