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 - 9 / 9
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: 1343; Prenosov: 49
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: 1090; Prenosov: 28
URL Polno besedilo (0,00 KB)

3.
On the readability of overlap digraphs
Paul Medvedev, Martin Milanič, Rayan Chikhi, Sofya Raskhodnikova, 2015, objavljeni znanstveni prispevek na konferenci

Najdeno v: ključnih besedah
Povzetek najdenega: ... bipartite graph, readability, overlap labeling, ...
Ključne besede: bipartite graph, readability, overlap labeling
Objavljeno: 15.10.2015; Ogledov: 1302; Prenosov: 62
URL Polno besedilo (0,00 KB)

4.
Equistarable bipartite graphs
Martin Milanič, Endre Boros, Nina Chiarelli, 2015, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...equistable graph, general partition graph, bipartite graph, equistarable graph,...
Ključne besede: equistable graph, general partition graph, bipartite graph, equistarable graph, 2-extendable graph
Objavljeno: 03.04.2017; Ogledov: 834; Prenosov: 93
URL Polno besedilo (0,00 KB)

5.
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: 1153; Prenosov: 20
URL Polno besedilo (0,00 KB)

6.
Bipartite graphs of small readability
Rayan Chikhi, Vladan Jovičić, Stefan Kratsch, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova, Nidhi Varma Srivastava, 2018, objavljeni znanstveni prispevek na konferenci

Najdeno v: ključnih besedah
Povzetek najdenega: ...bipartite graph, readability, bipartite chain graph, polynomial-time algorithm, grid...
Ključne besede: bipartite graph, readability, bipartite chain graph, polynomial-time algorithm, grid graph
Objavljeno: 17.09.2018; Ogledov: 353; Prenosov: 20
URL Polno besedilo (0,00 KB)

7.
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: 382; Prenosov: 9
URL Polno besedilo (0,00 KB)

8.
Bipartite graphs of small readability
Rayan Chikhi, Vladan Jovičić, Stefan Kratsch, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova, Nithin Varma, 2019, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...bipartite graph, readability, bipartite chain graph, polynomial-time algorithm, grid...
Ključne besede: bipartite graph, readability, bipartite chain graph, polynomial-time algorithm, grid graph
Objavljeno: 26.07.2019; Ogledov: 150; Prenosov: 24
URL Polno besedilo (0,00 KB)

9.
Eccentricity of networks with structural constraints
Jean-Sébastien Sereni, Matjaž Krnc, Riste Škrekovski, Zelealem B. Yilma, 2018, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...eccentricity, network, bipartite graph, complex network, maximum degree...
Ključne besede: eccentricity, network, bipartite graph, complex network, maximum degree
Objavljeno: 22.08.2019; Ogledov: 156; Prenosov: 40
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