On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme

2023/02/15 by Aida Abiad, Abiad, Aida, Robin Simoens +3 · 1 citation
Mathematics · Computer Science · #Graph theory and applications #Advanced Graph Theory Research #Finite Group Theory Research

paper · pdf · doi:10.48550/arxiv.2302.07757

Abstract

We determine the diameter of generalized Grassmann graphs and the zero forcing number of some generalized Johnson graphs, generalized Grassmann graphs and the Hamming graphs. Our work extends several previously known results.

Cited by

• The Zero Forcing Number of Twisted Hypercubes

Related

• A Survey of Cameron-Liebler Sets and Low Degree Boolean Functions in Grassmann Graphs
• The zero blocking numbers of generalized Kneser graphs and generalized Johnson graphs
• The smallest eigenvalues of Hamming graphs, Johnson graphs and other\n distance-regular graphs with classical parameters
• Boolean degree 1 functions on some classical association schemes
• Completely regular codes in Johnson and Grassmann graphs with small covering radii