Distance-balanced graphs
Abstract
V članku so vpeljani razdaljno uravnoteženi grafi kot grafi, v katerih ima vsaka povezava ▫$uv$▫ naslednjo lastnost: število točk, ki so bližje ▫$u$▫ kot ▫$v$▫, je enako kot število točk, ki so bližje ▫$v$▫ kot ▫$u$▫. Dobljene so osnovne lastnosti teh grafov. Novi koncept je povezan z grafovskimi simetrijami, študirane so tudi lokalne operacije na grafih glede na razdaljno uravnoteženost. Karakterizirani so razdaljno uravnoteženi kartezični in leksikografski produkti grafov. Postavljenih je več odprtih problemov.
Keywords
matematika;teorija grafov;razdalja;razdaljno uravnoteženi grafi;produkti grafov;povezanost;mathematics;graph theory;graph distance;distance-balanced graphs;graph products;connectivity;
Data
| Language: | English |
|---|---|
| Year of publishing: | 2008 |
| Typology: | 1.01 - Original Scientific Article |
| Organization: | UM PEF - Faculty of Education |
| UDC: | 519.17 |
| COBISS: |
14680153
|
| ISSN: | 0218-0006 |
| Views: | 941 |
| Downloads: | 82 |
| Average score: | 0 (0 votes) |
| Metadata: |
|
Other data
| 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. 71-79 |
| Volume: | ǂVol. ǂ12 |
| Issue: | ǂno. ǂ1 |
| Chronology: | 2008 |
| ID: | 1473563 |
Recommended works:
Distance-balanced graphs
2008,
no subtitle data available
Distance-balanced graphs
2005,
no subtitle data available
Strongly distance-balanced graphs and graph products
2008,
no subtitle data available
Distance-balanced graphs: Symmetry conditions
2006,
no subtitle data available
Connectivity of Cartesian products of graphs
2008,
no subtitle data available