Distance-balanced graphs

Jerebic, Janja; Klavžar, Sandi; Rall, Douglas F.

| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

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://dx.doi.org/10.1007/s00026-008-0337-2
Language:	English
Work type:	Not categorized
Typology:	1.01 - Original Scientific Article
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:	2008
Number of pages:	str. 71-79
Numbering:	Vol. 12, no. 1
PID:	20.500.12556/DKUM-51673
UDC:	519.17
ISSN on article:	0218-0006
COBISS.SI-ID:	14680153
NUK URN:	URN:SI:UM:DK:K9FHMZ8J
Publication date in DKUM:	10.07.2015
Views:	1655
Downloads:	98
Metadata:
Categories:	Misc.
:	JEREBIC, Janja, KLAVŽAR, Sandi and RALL, Douglas F., 2008, Distance-balanced graphs. Annals of combinatorics [online]. 2008. Vol. 12, no. 1, p. 71–79. [Accessed 17 March 2025]. Retrieved from: http://dx.doi.org/10.1007/s00026-008-0337-2 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:

Similar works from other repositories:

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

Record is a part of a journal

Title:	Annals of combinatorics
Shortened title:	Ann. comb.
Publisher:	Springer Singapore
ISSN:	0218-0006
COBISS.SI-ID:	8204633

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