Graph Evolution Using Oriented Incidence Matrices

Abstract

In this paper we introduce a general representtation of networks that can be modelled as planar graphs, by using oriented incidence matrices. The representation is used to obtain a unitary vision on weighted and non-weighted networks corresponding to circuits that have (or do not have) passive elements between connective nodes. The implications related to the general problem of Hamiltonicity is analyzed, too.