0
$\begingroup$

Considering the following graph with 3 nodes and 3 edges which I ran into:

enter image description here

what is the definition, in Graph Theory, of the L matrix? Is it the Laplacian or the Incidence Matrix? Or is it derived from something else?

This of course is a flow study problem.

  • 0
    I think that it is neither the laplacian or the incident matrix.. – 2017-02-20
  • 0
    That is a weighted Laplacian where you take the weights to be the reciprocals of the lengths. – 2017-02-20
  • 1
    Note though that by convention in graph theory the Laplacian would be the negative of that (i.e. it would have positive diagonal entries and negative off-diagonal entries). Thus the graph theory convention is backwards from the differential equations convention. – 2017-02-20

0 Answers 0