Jezik: | Angleški jezik |
---|---|
Leto izida: | 2008 |
Tipologija: | 1.01 - Izvirni znanstveni članek |
Organizacija: | UM PEF - Pedagoška fakulteta |
UDK: | 519.17 |
COBISS: | 14680153 |
ISSN: | 0218-0006 |
Št. ogledov: | 941 |
Št. prenosov: | 82 |
Ocena: | 0 (0 glasov) |
Metapodatki: |
Sekundarni jezik: | Neznan jezik |
---|---|
Sekundarni naslov: | Razdaljno uravnoteženi grafi |
Sekundarni povzetek: | Distance-balanced graphs are introduced as graphs in which every edge $uv$ has the following property: the number of vertices closer to ▫$u$▫ than to ▫$v$▫ is equal to the number of vertices closer to ▫$v$▫ than to ▫$u$▫. Basic properties of these graphs are obtained. The new concept is connected with symmetry conditions in graphs and local operations on graphs are studied with respect to it. Distance-balanced Cartesian and lexicographic products of graphs are also characterized. Several open problems are posed along the way. |
Sekundarne ključne besede: | matematika;teorija grafov;razdalja;razdaljno uravnoteženi grafi;produkti grafov;povezanost; |
URN: | URN:SI:UM: |
Vrsta dela (COBISS): | Delo ni kategorizirano |
Strani: | str. 71-79 |
Letnik: | ǂVol. ǂ12 |
Zvezek: | ǂno. ǂ1 |
Čas izdaje: | 2008 |
ID: | 1473563 |