Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
|
|
SLO
|
ENG
|
Cookies and privacy
DKUM
EPF - Faculty of Business and Economics
FE - Faculty of Energy Technology
FERI - Faculty of Electrical Engineering and Computer Science
FF - Faculty of Arts
FGPA - Faculty of Civil Engineering, Transportation Engineering and Architecture
FKBV - Faculty of Agriculture and Life Sciences
FKKT - Faculty of Chemistry and Chemical Engineering
FL - Faculty of Logistic
FNM - Faculty of Natural Sciences and Mathematics
FOV - Faculty of Organizational Sciences in Kranj
FS - Faculty of Mechanical Engineering
FT - Faculty of Tourism
FVV - Faculty of Criminal Justice and Security
FZV - Faculty of Health Sciences
MF - Faculty of Medicine
PEF - Faculty of Education
PF - Faculty of Law
UKM - University of Maribor Library
UM - University of Maribor
UZUM - University of Maribor Press
COBISS
Faculty of Business and Economic, Maribor
Faculty of Agriculture and Life Sciences, Maribor
Faculty of Logistics, Celje, Krško
Faculty of Organizational Sciences, Kranj
Faculty of Criminal Justice and Security, Ljubljana
Faculty of Health Sciences
Library of Technical Faculties, Maribor
Faculty of Medicine, Maribor
Miklošič Library FPNM, Maribor
Faculty of Law, Maribor
University of Maribor Library
Bigger font
|
Smaller font
Introduction
Search
Browsing
Upload document
For students
For employees
Statistics
Login
First page
>
Show document
Show document
Title:
Distance-balanced graphs
Authors:
ID
Jerebic, Janja
(Author)
ID
Klavžar, Sandi
(Author)
ID
Rall, Douglas F.
(Author)
Files:
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
u
v
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
ISSN:
1318-4865
UDC:
519.17
COBISS.SI-ID:
13785689
NUK URN:
URN:SI:UM:DK:A0WTLVHU
Publication date in DKUM:
10.07.2015
Views:
1739
Downloads:
95
Metadata:
Categories:
Misc.
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
JEREBIC, Janja, KLAVŽAR, Sandi and RALL, Douglas F., 2005,
Distance-balanced graphs
[online]. 2005. [Accessed 17 March 2025]. Retrieved from: http://www.imfm.si/preprinti/PDF/00992.pdf
Copy citation
Average score:
0.5
1
1.5
2
2.5
3
3.5
4
4.5
5
(0 votes)
Your score:
Voting is allowed only for
logged in
users.
Share:
Similar works from our repository:
Grožnja izsiljevalske programske opreme za organizacije v kibernetskem prostoru
"HSC" frezanje s programsko opremo Euclid Machinist
Nevarnosti zlonamernega programja pri piratski programski opremi
Izbira brezplačnega programa za obrambo pred škodljivo programsko opremo
Programsko okolje Force 3.0
Similar works from other repositories:
Okužbe z visokorizičnimi genotipi HPV in testiranje HPV v cervikalnem presejalnem programu
Virulent factors of Escherichia coli isolates from feces of healthy humans
Monitoring of risk factors in treatment of surgical wounds in patients with inserted endoprosthesis
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
u
v
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
