English

A study on $T$-equivalent graphs

Combinatorics 2025-01-22 v1

Abstract

In his article [J. Comb. Theory Ser. B 16 (1974), 168-174], Tutte called two graphs TT-equivalent (i.e., codichromatic) if they have the same Tutte polynomial and showed that graphs GG and GG' are TT-equivalent if GG' is obtained from GG by flipping a rotor (i.e., replacing it by its mirror) of order at most 55, where a rotor of order kk in GG is an induced subgraph RR having an automorphism ψ\psi with a vertex orbit {ψi(u):i0}\{\psi^i(u): i\ge 0\} of size kk such that every vertex of RR is only adjacent to vertices in RR unless it is in this vertex orbit. In this article, we first show the above result due to Tutte can be extended to a rotor RR of order k6k\ge 6 if the subgraph of GG induced by all those edges of GG which are not in RR satisfies certain conditions. Also, we provide a new method for generating infinitely many non-isomorphic TT-equivalent pairs of graphs.

Keywords

Cite

@article{arxiv.2501.11383,
  title  = {A study on $T$-equivalent graphs},
  author = {Fengming Dong and Meiqiao Zhang},
  journal= {arXiv preprint arXiv:2501.11383},
  year   = {2025}
}

Comments

15 page, 8 figures

R2 v1 2026-06-28T21:11:10.452Z