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 - 10 / 16
Na začetekNa prejšnjo stran12Na naslednjo stranNa konec
1.
A classification of Q-polynomial distance-regular graphs with girth 6
Štefko Miklavič, 2025, izvirni znanstveni članek

Opis: Let Γ denote a Q-polynomial distance-regular graph with diameter D and valency k≥3. In [Homotopy in Q-polynomial distance-regular graphs, Discrete Math., {\bf 223} (2000), 189–206], H. Lewis showed that the girth of Γ is at most 6. In this paper we classify graphs that attain this upper bound. We show that Γ has girth 6 if and only if it is either isomorphic to the Odd graph on a set of cardinality 2D+1, or to a generalized hexagon of order (1,k−1).
Ključne besede: distance-regular graphs, Q-polynomial property, girth
Objavljeno v RUP: 01.12.2025; Ogledov: 1075; Prenosov: 3
.pdf Celotno besedilo (291,61 KB)
Gradivo ima več datotek! Več...

2.
On commutative association schemes and associated (directed) graphs
Giusy Monzillo, Safet Penjić, 2025, izvirni znanstveni članek

Opis: Let ${\mathcal M}$ denote the Bose--Mesner algebra of a commutative $d$-class association scheme ${\mathfrak X}$ (not necessarily symmetric), and $\Gamma$ denote a (strongly) connected (directed) graph with adjacency matrix $A$. Under the assumption that $A$ belongs to ${\mathcal M}$, we describe the combinatorial structure of $\Gamma$. Moreover, we provide an algebraic-combinatorial characterization of $\Gamma$ when $A$ generates ${\mathcal M}$. Among else, we show that, if ${\mathfrak X}$ is a commutative $3$-class association scheme that is not an amorphic symmetric scheme, then we can always find a (directed) graph $\Gamma$ such that the adjacency matrix $A$ of $\Gamma$ generates the Bose--Mesner algebra ${\mathcal M}$ of ${\mathfrak X}$.
Ključne besede: commutative association schemes, association schemes, Bose-Mesner algebra, equitable partition, graphs generating schemes, quotient-polynomial graphs, x-distance-faithful intersection diagram
Objavljeno v RUP: 26.09.2025; Ogledov: 345; Prenosov: 4
.pdf Celotno besedilo (483,56 KB)
Gradivo ima več datotek! Več...

3.
The distance function on Coxeter-like graphs and self-dual codes
Marko Orel, Draženka Višnjić, 2025, izvirni znanstveni članek

Ključne besede: Coxeter graph, invertible symmetric matrices, binary field, rank, distance in graphs, alternate matrices, self-dual codes
Objavljeno v RUP: 30.05.2025; Ogledov: 833; Prenosov: 18
.pdf Celotno besedilo (1,26 MB)
Gradivo ima več datotek! Več...

4.
5.
6.
7.
8.
9.
On the Terwilliger algebra of bipartite distance-regular graphs with [Delta][sub]2 = 0 and c[sub]2=1
Mark MacLean, Štefko Miklavič, Safet Penjić, 2016, izvirni znanstveni članek

Opis: Let ▫$\Gamma$▫ denote a bipartite distance-regular graph with diameter ▫$D \geq 4$▫ and valency ▫$k \geq 3$▫. Let ▫$X$▫ denote the vertex set of ▫$\Gamma$▫, and let ▫$A$▫ denote the adjacency matrix of ▫$\Gamma$▫. For ▫$x \in X$▫ and for ▫$0 \leq i \leq D$▫, let ▫$\operatorname{\Gamma}_i(x)$▫ denote the set of vertices in ▫$X$▫ that are distance ▫$i$▫ from vertex ▫$x$▫. Define a parameter ▫$\operatorname{\Delta}_2$▫ in terms of the intersection numbers by ▫$\operatorname{\Delta}_2 = (k - 2)(c_3 - 1) -(c_2 - 1) p_{22}^2$▫. We first show that ▫$\operatorname{\Delta}_2 = 0$▫ implies that ▫$D \leq 5$▫ or ▫$c_2 \in \{1, 2 \}$▫. For ▫$x \in X$▫ let ▫$T = T(x)$▫ denote the subalgebra of ▫$\text{Mat}_X(\mathbb{C})$▫ generated by ▫$A, E_0^\ast, E_1^\ast, \ldots, E_D^\ast$▫, where for ▫$0 \leq i \leq D$, $E_i^\ast$▫ represents the projection onto the▫ $i$▫th subconstituent of ▫$\Gamma$▫ with respect to ▫$x$▫. We refer to ▫$T$▫ as the Terwilliger algebra of ▫$\Gamma$▫ with respect to ▫$x$▫. By the endpoint of an irreducible ▫$T$▫-module ▫$W$▫ we mean ▫$\min \{i | E_i^\ast W \ne 0 \}$▫. In this paper we assume ▫$\Gamma$▫ has the property that for ▫$2 \leq i \leq D - 1$▫, there exist complex scalars ▫$\alpha_i$▫, ▫$\beta_i$▫ such that for all ▫$x, y, z \in X$▫ with ▫$\partial(x, y) = 2$▫, ▫$\partial(x, z) = i$▫, ▫$\partial(y, z) = i$▫, we have ▫$\alpha_i + \beta_i | \operatorname{\Gamma}_1(x) \cap \operatorname{\Gamma}_1(y) \cap \operatorname{\Gamma}_{i - 1}(z) | = | \operatorname{\Gamma}_{i - 1}(x) \cap \operatorname{\Gamma}_{i - 1}(y) \cap \operatorname{\Gamma}_1(z) |$▫. We additionally assume that▫ $\operatorname{\Delta}_2 = 0$▫ with ▫$c_2 = 1$▫. Under the above assumptions we study the algebra ▫$T$▫. We show that if ▫$\Gamma$▫ is not almost 2-homogeneous, then up to isomorphism there exists exactly one irreducible ▫$T$▫-module with endpoint 2. We give an orthogonal basis for this ▫$T$▫-module, and we give the action of ▫$A$▫ on this basis.
Ključne besede: distance-regular graphs, terwilliger algebra, subconstituent algebra
Objavljeno v RUP: 14.11.2017; Ogledov: 3989; Prenosov: 149
URL Povezava na celotno besedilo

10.
On maximal distances in a commuting graph
Gregor Dolinar, Bojan Kuzma, Polona Oblak, 2012, izvirni znanstveni članek

Opis: It is shown that matrices over algebraically closed fields that are farthest apart in the commuting graph must be non-derogatory. Rank-one matrices and diagonalizable matrices are also characterized in terms of the commuting graph.
Ključne besede: matematika, linearna algebra, teorija grafov, komutirajoči grafi, matrična algebra, algebraično zaprt obseg, centralizator, razdalja v grafih, mathematics, linear algebra, graph theory, commuting graph, matrix algebra, algebraically closed field, centralizer, distance in graphs
Objavljeno v RUP: 03.04.2017; Ogledov: 3746; Prenosov: 289
URL Povezava na celotno besedilo

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