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. Consequently, for A = {1, 2, 3}, the pairs \( (1,1), (2,2), \) and \( (3,3) \) must be included.
Given the inclusion of \( (1,2) \) and \( (2,3) \), transitivity mandates the inclusion of \( (1,3) \).
Step 2: Determine the count of valid relations.
The elements \( (2,1) \) and \( (3,2) \) are potential additions but must be excluded to avoid symmetry.
The number of relations that meet the criteria of reflexivity and transitivity, while excluding symmetry, is calculated as:
\[
7.
\]
Therefore, the solution is \( \boxed{7} \).