This note presents an iterative algorithm to solve the coupled Sylvester-transpose matrix equations (including the generalized coupled Sylvester matrix equations and Lyapunov matrix equations as special cases) over generalized centro-symmetric matrices. When the considered matrix equations are consistent, for any initial generalized centro-symmetric matrix group, a generalized centro-symmetric solution group can be obtained within finite iteration steps in the absence of roundoff errors. The least Frobenius norm generalized centro-symmetric solution group of the coupled Sylvester-transpose matrix equations can be derived when a suitable initial generalized centro-symmetric matrix group is chosen. In addition, for a given generalized centro-symmetric matrix group, the optimal approximation generalized centro-symmetric solution group can be obtained by finding the least Frobenius norm generalized centro-symmetric solution group of new coupled Sylvester-transpose matrix equations. Finally, a numerical example is given to demonstrate the efficiency of the introduced iterative algorithm.