English

Cartesian Prime Graphs and Cospectral Families

Discrete Mathematics 2025-06-02 v1

Abstract

We introduce a method for constructing larger families of connected cospectral graphs from two given cospectral families of sizes pp and qq. The resulting family size depends on the Cartesian primality of the input graphs and can be one of pqpq, p+q1p + q - 1, or max(p,q)\max(p, q), based on the strictness of the applied conditions. Under the strictest condition, our method generates O(p3q3)O(p^3q^3) new cospectral triplets, while the more relaxed conditions yield Ω(pq3+qp3)\varOmega(pq^3 + qp^3) such triplets. We also use the existence of specific cospectral families to establish that of larger ones.

Cite

@article{arxiv.2505.24358,
  title  = {Cartesian Prime Graphs and Cospectral Families},
  author = {Abhinav Bitragunta and Hareshkumar Jadav and Ranveer Singh},
  journal= {arXiv preprint arXiv:2505.24358},
  year   = {2025}
}
R2 v1 2026-07-01T02:50:10.468Z