Letter on the Chinese-T-game

Abstract

This letter presents three new minimization problems related to a new notion called the \emph{Chinese-T-game} in a simple connected graph. The minimization problems stem from the \emph{Chinese-T-walks} generated by the Chinese-T-game rules. It is a letter because some results rely on \emph{axiomatic reasoning} which the author find sufficient. However, some readers may find the reasoning not sufficiently rigorous. It is foreseen that the \emph{Chinese-T-game} will find application in at least, graph data science, robotics, AI, facial recognition, consumer preference analysis and alike. The ideas presented can easily be generalized to non-simple connected graphs.