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

DOI10.1016/J.DAM.2024.01.041MaRDI QIDQ6124433zbMATH OpenOpenAlexWikidataFDO

Authors Aida Abiad, Robin Simoens, S. Zeijlemaker

Publication date 27 March 2024

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

diameterGrassmann schemeHamming schemeJohnson schemezero forcing number

Mathematics Subject Classification ID

Distance in graphs (05C12) Association schemes, strongly regular graphs (05E30)

Abstract: We establish 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.

Recommendations

• A characterization of Grassmann and Johnson graphs
• On the girth and diameter of generalized Johnson graphs
• On the zero forcing number and spectral radius of graphs
• On the diameter and girth of zero-divisor graphs of posets
• A new family of distance-regular graphs with unbounded diameter

Cites work

• A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
• A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
• Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
• Complexity and computation of connected zero forcing
• Compressed cliques graphs, clique coverings and positive zero forcing
• Computational approaches for zero forcing and related problems
• Cospectral mates for the union of some classes in the Johnson association scheme
• Dominating sequences under atomic changes with applications in Sierpiński and interval graphs
• Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
• Fast-mixed searching and related problems on graphs
• Geometrical solution of an intersection problem for two hypergraphs
• Grundy dominating sequences and zero forcing sets
• Grundy domination and zero forcing in Kneser graphs
• Inverse Problems and Zero Forcing for Graphs
• Johnson graphs are Hamilton-connected
• On the complexity of the positive semidefinite zero forcing number
• On the diameter of Kneser graphs
• On the girth and diameter of generalized Johnson graphs
• On the total forcing number of a graph
• Parameters related to tree-width, zero forcing, and maximum nullity of a graph
• Zero forcing number, constrained matchings and strong structural controllability
• Zero forcing sets and the minimum rank of graphs

Cited in

(1)

• An approximation algorithm for zero forcing

This page was built for publication: On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6124433)