Paperlane

no. 15 · Monday 16 November 2026

Enumeration of Cospectral Graphs with Respect to the Average Flow Matrix

Usama Waheed and Naveed Ahmed Azam

math.CO

Abstract

A graph is said to be determined by the spectrum of a graph-associated matrix if no nonisomorphic graph shares the same spectrum with it. In this paper, we introduce the average flow matrix of a connected graph and study its spectral properties. We investigate its effectiveness in distinguishing graphs by carrying out a computational enumeration of connected graphs having a cospectral mate with respect to this matrix up to order 10. Our computations show that every connected graph on at most 10 vertices is determined by the spectrum of the average flow matrix. To the best of our knowledge, this is the first graph-associated matrix for which the spectrum distinguishes all connected graphs of order at most 10.

fields
Combinatorics, Spectral Theory
pdf ↗ page arXiv:2611.18344 ↗