Language: | English |
---|---|
Year of publishing: | 2005 |
Typology: | 0 - Not set |
Organization: | UM PEF - Faculty of Education |
UDC: | 519.17 |
COBISS: | 13785689 |
ISSN: | 1318-4865 |
Views: | 1053 |
Downloads: | 80 |
Average score: | 0 (0 votes) |
Metadata: |
Secondary language: | Unknown |
---|---|
Secondary title: | Razdaljno uravnoteženi grafi |
Secondary abstract: | 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. |
Secondary keywords: | matematika;teorija grafov;razdalja;razdaljno uravnoteženi grafi;produkti grafov;povezanost; |
URN: | URN:SI:UM: |
Type (COBISS): | Not categorized |
Pages: | str. 1-9 |
Volume: | ǂVol. ǂ43 |
Issue: | ǂšt. ǂ992 |
Chronology: | 2005 |
ID: | 66677 |