Step 1: Establish the conditions for reflexivity and transitivity. A relation is reflexive if, for every element \( x \) in set \( A \), the pair \( (x,x) \) is present. For \( A = \{1, 2, 3\} \), this necessitates the inclusion of \( (1,1), (2,2), (3,3) \). Given that \( (1,2) \) and \( (2,3) \) are present, transitivity mandates the inclusion of \( (1,3) \).
Step 2: Determine the count of valid relations. To maintain a lack of symmetry, the pairs \( (2,1) \) and \( (3,2) \) must be excluded.
The relations that fulfill reflexivity and transitivity but not symmetry are enumerated. The count is as follows: \[ 7. \] Therefore, the final answer is \( \boxed{7} \).