Maximum nullity and zero forcing of circulant graphs

DOI10.1515/spma-2020-0106zbMath1457.05063arXiv1906.03079OpenAlexW3110965025MaRDI QIDQ2663691

Kevin N. Vander Meulen, Michael Riddell, Adam Van Tuyl, Linh Duong, Brenda K. Kroschel

Publication date: 19 April 2021

Published in: Special Matrices (Search for Journal in Brave)

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

zbMATH Keywords

bipartite graphcirculant graphminimum rankmaximum nullityzero forcinggraph product

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Vector spaces, linear dependence, rank, lineability (15A03) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

A zero forcing technique for bounding sums of eigenvalue multiplicities

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zero forcing sets and bipartite circulants
• On planarity and colorability of circulant graphs
• Families of graphs with maximum nullity equal to zero forcing number
• A lower bound on the zero forcing number
• Locally grid graphs: Classification and Tutte uniqueness
• Ádám's conjecture is true in the square-free case
• Zero forcing sets and the minimum rank of graphs
• Circulants and their connectivities
• Graphs whose minimal rank is two
• Bounds for the Zero Forcing Number of Graphs with Large Girth
• The minimum rank problem for circulants

This page was built for publication: Maximum nullity and zero forcing of circulant graphs