| Title: | On cube-free median graphs |
|---|
| Authors: | ID Brešar, Boštjan (Author)
ID Klavžar, Sandi (Author)
ID Škrekovski, Riste (Author) |
|---|
| Files: |  http://www.imfm.si/preprinti/PDF/00886.pdf
|
|---|
| Language: | English |
|---|
| Work type: | Not categorized |
|---|
| Organization: | FERI - Faculty of Electrical Engineering and Computer Science
|
|---|
| Abstract: | Naj bo ▫$G$▫ mediansk graf brez 3-kocke. Pokazano je, da velja ▫$frac{k}{2} ge sqrt{n}-1 ge frac{m}{2sqrt{n}} ge sqrt{s} ge r-1$▫, kjer so ▫$n, m, s, k$▫ in ▫$r$▫ števila točk, povezav, kvadratov, ▫$Theta$▫-razredov in število povezav najmanšega ▫$Theta$▫-razreda grafa ▫$G$▫. Enakosti so dosežene natanko tedaj, ko je ▫$G$▫ kartezični produkt dveh dreves istega reda. Obravnavan je tudi polinom kock medianskih grafov in pokazano je, da lahko ravninske medianske grafe brez 3-kocke prepoznamo v linearnem času. |
|---|
| Keywords: | matematika, teorija grafov, medianski graf, kartezični produkt, prepoznavni algoritem, mathematics, graph theory, median graph, cube-free graph, Cartesian product, recognition algoritem |
|---|
| Year of publishing: | 2003 |
|---|
| Number of pages: | str. 1-9 |
|---|
| Numbering: | Vol. 41, št. 886 |
|---|
| PID: | 20.500.12556/DKUM-49368  |
|---|
| ISSN: | 1318-4865 |
|---|
| UDC: | 519.17 |
|---|
| COBISS.SI-ID: | 12589913 |
|---|
| NUK URN: | URN:SI:UM:DK:C5WBE0DR |
|---|
| Publication date in DKUM: | 10.07.2015 |
|---|
| Views: | 1572 |
|---|
| Downloads: | 74 |
|---|
| 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. |
