... ,gr)be a sequence of linear forms in indeterminants x1, ,xnover K (i.e., linear combinations of the xiwith coefficients in K). As defined in [4], such a sequence is a linear computationsequence ... the linear complexity of a graph to that of one of its subgraphs. In Section 3, wegive several upper and lower bounds on the linear complexity of a graph. In Section 4, weconsider the linear ... F.The linear complexity L(f1, ,fm)oftheset{f1, ,fm} of linear forms is the min-imum r ∈ N such that there is a linear computation sequence of length r that computes{f1, ,fm}.Thelinear...