Constructions of cospectral graphs with different zero forcing numbers
From MaRDI portal
Publication:5078599
zbMath1489.05087arXiv2111.12343MaRDI QIDQ5078599
Thomas R. Cameron, Boris Brimkov, Ralihe R. Villagrán, Himanshu Gupta, Aida Abiad, Jane Breen
Publication date: 23 May 2022
Full work available at URL: https://arxiv.org/abs/2111.12343
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Vector spaces, linear dependence, rank, lineability (15A03)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Cospectral regular graphs with and without a perfect matching
- Constructing cospectral graphs
- Spectra of graphs
- Zero forcing parameters and minimum rank problems
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- Which graphs are determined by their spectrum?
- Distance-regularity and the spectrum of graphs
- On NP-hard graph properties characterized by the spectrum
- Cospectral pairs of regular graphs with different connectivity
- Generalized cospectral graphs with and without Hamiltonian cycles
- On the Wiener index, distance cospectrality and transmission-regular graphs
- Practical graph isomorphism. II.
- Zero forcing sets and the minimum rank of graphs
- Line graphs: Their maximum nullities and zero forcing numbers
- Graphs that are cospectral for the distance Laplacian
- The Zero Forcing Number of Graphs
- Graphs cospectral with distance-regular graphs
- Strongly Regular Graphs
- Inverse Problems and Zero Forcing for Graphs
- On the complexity of the positive semidefinite zero forcing number
