UP - logo
Narodna in univerzitetna knjižnica, Ljubljana (NUK)
Naročanje gradiva za izposojo na dom
Naročanje gradiva za izposojo v čitalnice
Naročanje kopij člankov
Urnik dostave gradiva z oznako DS v signaturi
  • The strongly distance-balanced property og the generalized Petersen graphs
    Kutnar, Klavdija, 1980- ...
    A graph ▫$X$▫ is said to be strongly distance-balanced whenever for any edge ▫$uv$▫ of ▫$X$▫ and any positive integer ▫$i$▫, the number of vertices at distance ▫$i$▫ from ▫$u$▫ and at distance ▫$i + ... 1$▫ from ▫$v$▫ is equal to the number of vertices at distance ▫$i + 1$▫ from ▫$u$▫ and at distance ▫$i$▫ from ▫$v$▫. It is proven that for any integers ▫$k \ge 2$▫ and ▫$n \ge k^2 + 4k + 1$▫, the generalized Petersen graph GP▫$(n, k)$▫ is not strongly distance-balanced.
    Vir: Ars mathematica contemporanea. - ISSN 1855-3966 (Vol. 2, no. 1, 2009, str. 41-47)
    Vrsta gradiva - članek, sestavni del ; neleposlovje za odrasle
    Leto - 2009
    Jezik - angleški
    COBISS.SI-ID - 1024077396

vir: Ars mathematica contemporanea. - ISSN 1855-3966 (Vol. 2, no. 1, 2009, str. 41-47)

loading ...
loading ...
loading ...