Table 1.

Summary of main results

Result	Explanation
Corollary 4.3	Gives necessary and sufficient conditions for a strongly input–output connected model to be an identifiable path/cycle model
Theorem 3.22	Gives a sufficient condition to be an identifiable path/cycle model based on graph structure
Corollary 5.11	Gives necessary and sufficient conditions for an output connectable model to be an identifiable path/cycle model