| Naslov: | Strongly distance-balanced graphs and graph products |
|---|
| Avtorji: | ID Balakrishnan, Kannan (Avtor)
ID Changat, Manoj (Avtor)
ID Peterin, Iztok (Avtor)
ID Špacapan, Simon (Avtor)
ID Šparl, Primož (Avtor)
ID Subhamathi, Ajitha R. (Avtor) |
|---|
| Datoteke: |  http://dx.doi.org/10.1016/j.ejc.2008.09.018
|
|---|
| Jezik: | Angleški jezik |
|---|
| Vrsta gradiva: | Delo ni kategorizirano |
|---|
| Tipologija: | 1.01 - Izvirni znanstveni članek |
|---|
| Organizacija: | FERI - Fakulteta za elektrotehniko, računalništvo in informatiko
|
|---|
| Opis: | A graph ▫$G$▫ is strongly distance-balanced if for every edge ▫$uv$▫ of ▫$G$▫ and every ▫$i ge 0$▫ the number of vertices ▫$x$▫ with ▫$d(x,u) = d(x,v)-1 = i$▫ equals the number of vertices ▫$y$▫ with ▫$d(y,v) = d(y,u)-1 = i$▫. It is proved that the strong product of graphs is strongly distance-balanced if and only if both factors are strongly distance-balanced. It is also proved that connected components of the direct product of two bipartite graphs are strongly distance-balanced if and only if both factors are strongly distance-balanced. Additionally, a new characterization of distance-balanced graphs and an algorithm of time complexity ▫$O(mn)$▫ for their recognition, where m is the number of edges and ▫$n$▫ the number of vertices of the graph in question, are given. |
|---|
| Ključne besede: | matematika, teorija grafov, razdaljno uravnoteženi grafi, mathematics, graph theory, distance-balanced grapha |
|---|
| Leto izida: | 2008 |
|---|
| Št. strani: | str. 1048-1053 |
|---|
| Številčenje: | Vol. 30, iss. 5 |
|---|
| PID: | 20.500.12556/DKUM-51773  |
|---|
| UDK: | 519.17 |
|---|
| COBISS.SI-ID: | 15079769 |
|---|
| DOI: | 10.1016/j.ejc.2008.09.018 |
|---|
| ISSN pri članku: | 0195-6698 |
|---|
| NUK URN: | URN:SI:UM:DK:E4TPOWHC |
|---|
| Datum objave v DKUM: | 10.07.2015 |
|---|
| Število ogledov: | 2302 |
|---|
| Število prenosov: | 102 |
|---|
| 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. |
