***** To join INSNA, visit http://www.insna.org *****
Say we have a triangular grid (tiling) formed by nxm vertices (i.e., a
graph in which all internal vertices have degree 6). What I want to
obtain is the structure of the matrix (or list) representation of its
edges. Of course, this depends on the enumeration of vertices. Thus,
the question is what re-ordering gives the simplest general form of
such a matrix (or list) and what is exactly this form?
My motivation comes from that I want to make a simulation of a network
influence situation in which edges (ties) are influenced by the
incident ones (than vertices being influenced by the neighboring ones)
according to certain rules. In fact, first I'm assuming that the grid
is signed and that signs of edges may change in such a way that they
follow the structural stability or instability of the triangles with
I would appreciate any help or hints on how I might proceed in dealing
with this problem.
SOCNET is a service of INSNA, the professional association for social
network researchers (http://www.insna.org). To unsubscribe, send
an email message to [log in to unmask] containing the line
UNSUBSCRIBE SOCNET in the body of the message.