Distance mean-regular graphs

DOI10.1007/s10623-016-0208-5zbMath1367.05055arXiv1508.03835OpenAlexW1840483925MaRDI QIDQ2364624

Víctor Diego, Miquel Àngel Fiol

Publication date: 21 July 2017

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.03835

zbMATH Keywords

distance-regular graphspectrumvertex-transitive graphinterlacingadjacency algebradistance mean-regular graphintersection mean-matrix

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (1)

On the status sequences of trees

Cites Work

• Pseudo-distance-regularized graphs are distance-regular or distance-biregular
• Some spectral and quasi-spectral characterizations of distance-regular graphs
• Spectra of graphs
• Distance degree regular graphs
• On distance-regularity in graphs
• Eigenvalue interlacing and weight parameters of graphs
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• Distance-regularised graphs are distance-regular or distance-biregular
• Interlacing eigenvalues and graphs
• Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Distance mean-regular graphs