Cover Image

A classification of $Q$-polynomial distance-regular graphs with girth $6$

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Miklavič, Štefko
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 05C50, 05C38
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On distance magic circulants of valency 6
by: Miklavič, Štefko, et al.
Published: (2022)

On the $Q$-polynomial property of the full bipartite graph of a Hamming graph
by: Fernández, Blas, et al.
Published: (2024)

On the $Q$-polynomial property of bipartite graphs admitting a uniform structure
by: Fernández, Blas, et al.
Published: (2025)

Tight factorizations of girth-$g$-regular graphs
by: Dejter, Italo J.
Published: (2021)

On main eigenvalues of certain graphs
by: Abreu, Nair, et al.
Published: (2016)

Nonexistence of certain edge-girth-regular graphs
by: Droogendijk, Leen
Published: (2024)

Aα-spectral radius and path-factor covered graphs
by: Zhou, Sizhong, et al.
Published: (2024)

An Aα-spectral radius for the existence of {P3, P4, P5}-factors in graphs
by: Zhang, Yuli, et al.
Published: (2025)

Total coloring of regular graphs of girth = degree + 1
by: Dejter, Italo J.
Published: (2024)

On the girth and connectivity of cubic graphs with a unique longest cycle
by: Jooken, Jorik, et al.
Published: (2024)

On a trace formula of counting Eulerian cycles
by: Luo, Ye
Published: (2025)

A bound on the girth of quaternion unit gain graphs in terms of the rank
by: Khan, Suliman, et al.
Published: (2024)

Spectral radius and Hamiltonian properties of graphs, II
by: Ge, Jun, et al.
Published: (2016)

Characterizing the positive inertia index of connected signed graphs in terms of girth
by: Khan, Suliman, et al.
Published: (2025)

The partition dimension and $k$-domination number of a family of non-distance regular graph
by: Zafari, Ali, et al.
Published: (2026)

Towards a classification of $1$-homogeneous distance-regular graphs with positive intersection number $a_1$
by: Koolen, Jack H., et al.
Published: (2024)

The distance spectrum of the bipartite double cover of strongly regular graphs
by: Mirafzal, S. Morteza
Published: (2025)

A combinatorial bound on the number of distinct eigenvalues of a graph
by: Allred, Sarah, et al.
Published: (2022)

On cores of distance-regular graphs
by: Geertsema, Annemarie, et al.
Published: (2025)

Gain distance Laplacian matrices for complex unit gain graphs
by: Khan, Suliman
Published: (2024)

Shortest Circuits in Homology Classes of Graphs
by: Luo, Ye
Published: (2025)

Fourier analysis on distance-regular Cayley graphs over abelian groups
by: Zhan, Xiongfeng, et al.
Published: (2024)

Katz similarity index comparisons
by: Evans, Emily J., et al.
Published: (2025)

Spanning k-trees and distance spectral radius in graphs
by: Zhou, Sizhong, et al.
Published: (2023)

On the resistance regular graphs
by: T, Haritha, et al.
Published: (2024)

Sufficient spectral conditions for graphs being $k$-edge-Hamiltonian or $k$-Hamiltonian
by: Li, Yongtao, et al.
Published: (2021)

Independence polynomials of graphs
by: Hibi, Takayuki, et al.
Published: (2026)

Distance-regular graphs with a few $q$-distance eigenvalues
by: Abdullah, Mamoon, et al.
Published: (2024)

The exponential distance matrix of bi-block graphs
by: Das, Joyentanuj, et al.
Published: (2025)

Parity conditions for one-way rail networks
by: Akita, Dai, et al.
Published: (2023)

On the $P$-vertex problem in Bipartite Graphs
by: Arunkumar, G., et al.
Published: (2025)

On the degrees of regular nut graphs and Cayley nut graphs
by: Bašić, Nino, et al.
Published: (2024)

Graphs of large girth
by: Reiher, Christian
Published: (2024)

A $q$-analogue of distance matrix of bi-block graphs
by: Das, Joyentanuj
Published: (2025)

Non-geometric distance-regular graphs of diameter at least $3$ with smallest eigenvalue at least $-3$
by: Koolen, Jack, et al.
Published: (2023)

The fundamental module of $S_3$-symmetric tridiagonal algebra associated with cycles
by: Morales, J. V. S.
Published: (2025)

Construction of Linear Codes from the Unit Graph $G(\mathbb{Z}_{n})$
by: Jain, Rupali S., et al.
Published: (2023)

Toughness in regular graphs from eigenvalues
by: Liu, Ruifang, et al.
Published: (2025)

Maximizing subgraph counts in regular graphs
by: Lippner, Gabor, et al.
Published: (2026)

On the distance spectral gap and construction of D-equienergetic graphs
by: T, Haritha, et al.
Published: (2025)