1. |
2. 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: 204; Prenosov: 3
 Celotno besedilo (291,61 KB)
Gradivo ima več datotek! Več... |
3. On 3-isoregularity of multicirculantsKlavdija Kutnar, Dragan Marušič, Štefko Miklavič, 2025, izvirni znanstveni članek Opis: A graph is said to be k-isoregular if any two vertex subsets of cardinality at most k, that induce subgraphs of the same isomorphism type, have the same number of neighbors. It is shown that no 3-isoregular bicirculant (and more generally, no locally 3-isoregular bicirculant) of order twice an odd number exists. Further, partial results for bicirculants of order twice an even number as well as tricirculants of specific orders, are also obtained. Since 3-isoregular graphs are necessarily strongly regular, a motivation for the above result about bicirculants is that it brings us a step closer to obtaining a direct proof of a classical consequence of the Classification of Finite Simple Groups, that no simply primitive group of degree twice a prime exists for primes greater than 5.
Ključne besede: 3-isoregularity, strongly regular graph, bicirculant, tricirculant
Objavljeno v RUP: 06.08.2025; Ogledov: 411; Prenosov: 3
Celotno besedilo (233,35 KB) |
4. |
5. |
6. |
7. |
8. |
9. |
10. |
