Re: similarity between two graphs

From: Proginoskes <CCHeckman@xxxxxxxxx>
Date: Fri, 13 Jul 2007 04:31:50 -0000

On Jul 12, 8:00 pm, Roy <royl...@xxxxxxxxxxx> wrote:

Hi,

I was wondering if there are any standard metrics that can be used to
quantify the similarity between two undirected graphs. For example,
distribution of the node degrees, etc.

I'm not aware of anything is standard. Do you have a particular
application in mind?

You could, for instance, define d(G,H) to be the maximum number of
edges which are in exactly one of G and phi(H), where phi ranges over
all permutations of V(G).

--- Christopher Heckman

.

References:
- similarity between two graphs
  - From: Roy

Prev by Date: Re: Ultimate debunking of Cantor's Theory
Next by Date: Re: set theory : the blunder
Previous by thread: similarity between two graphs
Next by thread: W. Mückenheim fails at Cantor bashing
Index(es):
- Date
- Thread