The paper claims a complete classification of connected graphs whose Cartesian, Kronecker, strong, and lexicographic products coincide, plus a spectral graph theory by-product.
Panigrahi, Families of graphs having few distinct distance eigenvalues with arbitrary diameter, Electron
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
When Are Standard Graph Products Isomorphic?
The paper claims a complete classification of connected graphs whose Cartesian, Kronecker, strong, and lexicographic products coincide, plus a spectral graph theory by-product.