On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme
From MaRDI portal
Publication:6124433
DOI10.1016/j.dam.2024.01.041arXiv2302.07757OpenAlexW4391589907WikidataQ128466640 ScholiaQ128466640MaRDI QIDQ6124433
Robin Simoens, S. Zeijlemaker, Aida Abiad
Publication date: 27 March 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.07757
Cites Work
- Fast-mixed searching and related problems on graphs
- Zero forcing number, constrained matchings and strong structural controllability
- Geometrical solution of an intersection problem for two hypergraphs
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- Computational approaches for zero forcing and related problems
- Cospectral mates for the union of some classes in the Johnson association scheme
- On the total forcing number of a graph
- Grundy dominating sequences and zero forcing sets
- Complexity and computation of connected zero forcing
- A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
- On the girth and diameter of generalized Johnson graphs
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Zero forcing sets and the minimum rank of graphs
- On the diameter of Kneser graphs
- Compressed cliques graphs, clique coverings and positive zero forcing
- Johnson graphs are Hamilton-connected
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- Inverse Problems and Zero Forcing for Graphs
- Grundy domination and zero forcing in Kneser graphs
- Dominating sequences under atomic changes with applications in Sierpiński and interval graphs
- A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
- On the complexity of the positive semidefinite zero forcing number
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
