| Naslov: | Connectivity of Fibonacci cubes, Lucas cubes, and generalized cubes |
|---|
| Avtorji: | ID Azarija, Jernej (Avtor)
ID Klavžar, Sandi (Avtor)
ID Lee, Jaehun (Avtor)
ID Rho, Yoomi (Avtor) |
|---|
| Datoteke: |  Discrete_Mathematics_&_Theoretical_Computer_Science_2015_Azarija_et_al._Connectivity_of_Fibonacci_cubes,_Lucas_cubes,_and_generalized_cu.pdf (740,04 KB)
MD5: 05275ACF191765822279C45779297063
PID: 20.500.12556/dkum/a74b33cb-763b-4c5f-97e8-596f10d3a5dc
 http://dmtcs.episciences.org/2115
|
|---|
| Jezik: | Angleški jezik |
|---|
| Vrsta gradiva: | Znanstveno delo |
|---|
| Tipologija: | 1.01 - Izvirni znanstveni članek |
|---|
| Organizacija: | FNM - Fakulteta za naravoslovje in matematiko
|
|---|
| Opis: | If ▫$f$▫ is a binary word and ▫$d$▫ a positive integer, then the generalized Fibonacci cube ▫$Q_d(f)$▫ is the graph obtained from the ▫$d$▫-cube ▫$Q_d$▫ by removing all the vertices that contain ▫$f$▫ as a factor, while the generalized Lucas cube ▫$Q_d(\stackrel{\leftharpoondown}{f})$▫ is the graph obtained from ▫$Q_d$▫ by removing all the vertices that have a circulation containing ▫$f$▫ as a factor. The Fibonacci cube ▫$\Gamma_d$▫ and the Lucas cube ▫$\Lambda_d$▫ are the graphs ▫$Q_d({11})$▫ and ▫$Q_d(\stackrel{\leftharpoondown}{11})$▫, respectively. It is proved that the connectivity and the edge-connectivity of ▫$\Gamma_d$▫ as well as of ▫$\Lambda_d$▫ are equal to ▫$\left\lfloor \frac{d+2}{3}\right\rfloor$▫. Connected generalized Lucas cubes are characterized and generalized Fibonacci cubes are proved to be 2-connected. It is asked whether the connectivity equals minimum degree also for all generalized Fibonacci/Lucas cubes. It was checked by computer that the answer is positive for all ▫$f$▫ and all ▫$d \le9$▫. |
|---|
| Ključne besede: | Fibonacci cube, Lucas cube, generalized Fibonacci cube, generalized Lucas cube, connectivity, combinatorics on words |
|---|
| Status publikacije: | Objavljeno |
|---|
| Verzija publikacije: | Objavljena publikacija |
|---|
| Poslano v recenzijo: | 01.10.2014 |
|---|
| Datum sprejetja članka: | 28.01.2015 |
|---|
| Datum objave: | 04.02.2015 |
|---|
| Založnik: | Discrete Mathematics & Theoretical Computer Science |
|---|
| Leto izida: | 2015 |
|---|
| Št. strani: | Str. 79-88 |
|---|
| Številčenje: | Letn. 17, št. 1 |
|---|
| PID: | 20.500.12556/DKUM-66780  |
|---|
| ISSN: | 1365-8050 |
|---|
| UDK: | 519.17:004 |
|---|
| COBISS.SI-ID: | 17220697 |
|---|
| ISSN pri članku: | 1365-8050 |
|---|
| NUK URN: | URN:SI:UM:DK:0XCNAHN9 |
|---|
| Datum objave v DKUM: | 10.07.2017 |
|---|
| Število ogledov: | 1520 |
|---|
| Število prenosov: | 220 |
|---|
| Metapodatki: |    |
|---|
| Področja: | Ostalo
|
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Skupna ocena: | (0 glasov) |
|---|
| Vaša ocena: | Ocenjevanje je dovoljeno samo prijavljenim uporabnikom. |
|---|
| Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |
