Let \(A\) and \(B\) be two graph and \(P(A,z)\) and \(P(B,z)\) are their chromatic polynomial, respectively. The two graphs \(A\) and \(B\) are said to be chromatic equivalent denoted by \( A \sim B \) if \(P(A,z)=P(B,z)\). A graph \(A\) is said to be chromatically unique(or simply \(\chi\)- unique) if for any graph \(B\) such that \(A\sim B \), we have \(A\cong B\), that is \(A\) is isomorphic to \(B\). In this paper, the chromatic uniqueness of a new family of \(6\)-bridge graph \(\theta(r,r,s,s,t,u)\) where \(2\leq r\leq s \leq t\leq u\) is investigated.
