izpis_h1_title_alt

On the connectivity of bipartite distance-balanced graphs
Miklavič, Štefko (Avtor), Šparl, Primož (Avtor)

URLURL - Predstavitvena datoteka, za dostop obiščite http://dx.doi.org/10.1016/j.ejc.2011.10.002 Povezava se odpre v novem oknu

Izvleček
A connected graph ▫$\varGamma$▫ is said to be distance-balanced whenever for any pair of adjacent vertices ▫$u,v$▫ of ▫$\varGamma$▫ the number of vertices closer to ▫$u$▫ than to ▫$v$▫ is equal to the number of vertices closer to ▫$v$▫ than to ▫$u$▫. In [K. Handa, Bipartite graphs with balanced ▫$(a,b)$▫-partitions, Ars Combin. 51 (1999), 113-119] Handa asked whether every bipartite distance-balanced graph, that is not a cycle, is 3-connected. In this paper the Handa question is answered in the negative. Moreover, we show that a minimal bipartite distance-balanced graph, that is not a cycle and is not 3-connected, has 18 vertices and is unique. In addition, we give a complete classification of non-3-connected bipartite distance-balanced graphs for which the minimal distance between two vertices in a 2-cut is three. All such graphs are regular and for each ▫$k \geq 3$▫ there exists an infinite family of such graphs which are ▫$k$▫-regular.Furthermore, we determine a number of structural properties that a bipartite distance-balanced graph, which is not 3-connected, must have. As an application, we give a positive answer to the Handa question for the subfamily of bipartite strongly distance-balanced graphs.

Jezik:Angleški jezik
Ključne besede:graph theory, connected graphs, connectivity, distance-balanced graphs, bipartite graphs
Vrsta gradiva:Delo ni kategorizirano (r6)
Tipologija:1.01 - Izvirni znanstveni članek
Organizacija:PEF - Pedagoška fakulteta
Leto izida:2012
Št. strani:Str. 237-247
Številčenje:Vol. 33, no. 2
UDK:519.17
ISSN pri članku:0195-6698
COBISS.SI-ID:1024369748 Povezava se odpre v novem oknu
Število ogledov:635
Število prenosov:241
Metapodatki:XML RDF-CHPDL DC-XML DC-RDF
 
Skupna ocena:(0 glasov)
Vaša ocena:Ocenjevanje je dovoljeno samo prijavljenim uporabnikom.
:
Objavi na:AddThis
AddThis uporablja piškotke, za katere potrebujemo vaše privoljenje.
Uredi privoljenje...

Gradivo je del revije

Naslov:European journal of combinatorics
Skrajšan naslov:Eur. j. comb.
Založnik:Academic Press
ISSN:0195-6698
COBISS.SI-ID:25427968 Povezava se odpre v novem oknu

Sekundarni jezik

Jezik:Slovenski jezik
Naslov:O povezanosti dvodelnih razdaljno uravnoteženih grafov
Ključne besede:teorija grafov, povezani grafi, povzanost, razdaljno uravnoteženi grafi, dvodelni grafi

Podobna dela

Podobna dela v RUL:
Podobna dela v drugih slovenskih zbirkah:

Komentarji

Dodaj komentar

Za komentiranje se morate prijaviti.

Komentarji (0)
0 - 0 / 0
 
Ni komentarjev!

Nazaj