| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Distance-balanced graphs
Authors:ID Jerebic, Janja (Author)
ID Klavžar, Sandi (Author)
ID Rall, Douglas F. (Author)
Files:URL http://www.imfm.si/preprinti/PDF/00992.pdf
 
Language:English
Work type:Not categorized
Organization:PEF - Faculty of Education
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
Year of publishing:2005
Number of pages:str. 1-9
Numbering:Vol. 43, št. 992
PID:20.500.12556/DKUM-49372 New window
ISSN:1318-4865
UDC:519.17
COBISS.SI-ID:13785689 New window
NUK URN:URN:SI:UM:DK:A0WTLVHU
Publication date in DKUM:10.07.2015
Views:2120
Downloads:97
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:Unknown
Title:Razdaljno uravnoteženi grafi
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.


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica