| Title: | On cube-free median graphs |
|---|
| Authors: | Brešar, Boštjan (Author)
Klavžar, Sandi (Author)
Škrekovski, Riste (Author) |
|---|
| Files: |  http://dx.doi.org/10.1016/j.disc.2004.09.018
|
|---|
| Language: | English |
|---|
| Work type: | Not categorized (r6) |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| 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: | 2007 |
|---|
| Number of pages: | str. 345-351 |
|---|
| Numbering: | Vol. 307, iss. 3-5 |
|---|
| UDC: | 519.17 |
|---|
| ISSN on article: | 0012-365X |
|---|
| COBISS_ID: | 14179417  |
|---|
| NUK URN: | URN:SI:UM:DK:TRCATFX5 |
|---|
| Views: | 371 |
|---|
| Downloads: | 11 |
|---|
| Metadata: |     |
|---|
| Categories: | Misc.
|
|---|
|
:
|
|
|---|
| | | | 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. |
