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
Povzetek najdenega: ...A connected graph ▫$\varGamma$▫ is said to be distance-balanced whenever...
Ključne besede: graph theory, connected graphs, connectivity, distance-balanced graphs, bipartite graphs
Objavljeno: 15.10.2013; Ogledov: 1289; Prenosov: 46
URL Polno besedilo (0,00 KB)

2.
On bipartite Q-polynomial distance-regular graphs with c[sub]2 le 2
Štefko Miklavič, Safet Penjić, 2014, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...bipartite distance-regular graph, Q-polynomial property, equitable partition, ...
Ključne besede: bipartite distance-regular graph, Q-polynomial property, equitable partition
Objavljeno: 15.10.2015; Ogledov: 1040; Prenosov: 27
URL Polno besedilo (0,00 KB)

3.
On bipartite Q-polynomial distance-regular graphs with diameter 9, 10, or 11
Štefko Miklavič, 2018, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...bipartite distance-regular graph, Q-polynomial property, isomorphism...
Ključne besede: bipartite distance-regular graph, Q-polynomial property, isomorphism
Objavljeno: 12.03.2018; Ogledov: 1065; Prenosov: 18
URL Polno besedilo (0,00 KB)

4.
O Terwilligerjevi algebri dvodelnih razdaljno-regularnih grafov
Safet Penjić, 2019, doktorska disertacija

Najdeno v: ključnih besedah
Povzetek najdenega: ... bipartite distance-regular graph, Terwilliger algebra, subconstituent algebra, Q-polynomi...
Ključne besede: bipartite distance-regular graph, Terwilliger algebra, subconstituent algebra, Q-polynomial property, equitable partition
Objavljeno: 04.06.2019; Ogledov: 323; Prenosov: 7
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