Contents

Ars Combinatoria

  • Research article

Constructions of Pairs of Tutte-Equivalent Graphs

Helin Gong1,2, Metrose Metsidik 3
1 Department of Fundamental Courses, Zhejiang Industry Polytechnic College Shaoxing, Zhejiang 312000, China
2Guangxi Colleges and Universities Key Laboratory of Mathematical and Statistical Model, Guangxi Normal University, Guangxi 541004, China
3School of Mathematical Science, Xiamen University Xiamen, Fujian 361005, China
  • Published: 31/10/2017

Abstract

Two graphs are said to be Tutte-equivalent if their Tutte polynomials are equal. In this paper, we provide several different constructions for Tutte-equivalent graphs, including some that are not self-complementary but Tutte-equivalent to their complements (the Akiyama-Harary problem) and some “large” Tutte-equivalent graphs obtained from “small” Tutte-equivalent graphs by \(2\)-sum operations.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Helin Gong, Metrose Metsidik . Constructions of Pairs of Tutte-Equivalent Graphs[J], Ars Combinatoria, Volume 135. 223-234. .