Lupa

Iskanje po repozitoriju Pomoč

A- | A+ | Natisni
Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 4 / 4
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
On the connectivity of bipartite distance-balanced graphs
Štefko Miklavič, Primož Šparl, 2012, izvirni znanstveni članek

Opis: 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.
Najdeno v: ključnih besedah
Ključne besede: graph theory, connected graphs, connectivity, distance-balanced graphs, bipartite graphs
Objavljeno: 15.10.2013; Ogledov: 1296; Prenosov: 46
URL Polno besedilo (0,00 KB)

2.
On the readability of overlap digraphs
Rayan Chikhi, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova, 2016, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ... bipartite graphs, readability, overlap labeling, ...
Ključne besede: bipartite graphs, readability, overlap labeling
Objavljeno: 08.08.2016; Ogledov: 1218; Prenosov: 143
URL Polno besedilo (0,00 KB)

3.
On some properties of quasi-distance-balanced graphs
Ademir Hujdurović, 2018, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...distance-balanced graphs, quasi-distance-balanced graphs, bipartite graphs, bridge, razdaljno-uravnoteženi grafi, kvazi-razdaljno-uravnoteženi graf...
Ključne besede: distance-balanced graphs, quasi-distance-balanced graphs, bipartite graphs, bridge, razdaljno-uravnoteženi grafi, kvazi-razdaljno-uravnoteženi grafi, dvodelni grafi, most
Objavljeno: 07.02.2018; Ogledov: 1329; Prenosov: 68
URL Polno besedilo (0,00 KB)

4.
On biregular bipartite graphs of small excess
Slobodan Filipovski, Alejandra Ramos Rivera, Robert Jajcay, 2019, izvirni znanstveni članek

Najdeno v: ključnih besedah
Ključne besede: biregular bipartite graphs, degree/girth problem, asymptotic density
Objavljeno: 22.05.2019; Ogledov: 186; Prenosov: 71
URL Polno besedilo (0,00 KB)

Iskanje izvedeno v 0 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici