| Title: | The strongly distance-balanced property of the generalized Petersen graphs |
|---|
| Authors: | ID Kutnar, Klavdija (Author)
ID Malnič, Aleksander (Author)
ID Marušič, Dragan (Author)
ID Miklavič, Štefko (Author) |
|---|
| Files: |  RAZ_Kutnar_Klavdija_i2009.pdf (146,23 KB)
MD5: 873B81253895F0858428F04662DFD4E7
|
|---|
| Language: | English |
|---|
| Work type: | Unknown |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | ZUP - University of Primorska Press
|
|---|
| Abstract: | 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. |
|---|
| Keywords: | graph, strongy distance-balanced, generalized Petersen graph |
|---|
| Year of publishing: | 2009 |
|---|
| Number of pages: | str. 41-47 |
|---|
| Numbering: | Vol. 2, no. 1 |
|---|
| PID: | 20.500.12556/RUP-1901  |
|---|
| UDC: | 519.17 |
|---|
| ISSN on article: | 1855-3966 |
|---|
| COBISS.SI-ID: | 1024077396 |
|---|
| Publication date in RUP: | 15.10.2013 |
|---|
| Views: | 3700 |
|---|
| Downloads: | 134 |
|---|
| Metadata: |    |
|---|
|
:
|
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. |
