22 Oct
2010
22 Oct
'10
10:10 a.m.
Henry wrote: << . . . Interestingly, _planar graphs_ play a part in this paper! Who knew that linear algebra & planar graphs were connected ? . . .
Actually, any graph G can be defined by its connectivity matrix M = (m_ij), with m_ij = 1 if an edge connects nodes i and j, and 0 if not. Then there is the question of how the invariants of M, like its eigenvalues, are related to topological properties of G. This may not seem very closely fetched, but evidently people have got a lot of mileage out of it. --Dan _____________________________________________________________________ "It don't mean a thing if it ain't got that certain je ne sais quoi." --Peter Schickele