Re: [igraph] graph operators

[Tamas Nepusz]

Hi Eduardo,

> Is there any way to follow the names of vertices along graph  
> operations???
Are you trying to calculate the "normal" union (i.e., the two edge  
sets are united), or the "disjoint" union (i.e., the vertex set of  
graph 1 is extended by the vertex set of 2 and the vertices of graph 2  
are renumbered)? To highlight the difference between the two unions:  
taking the union of a full graph of five vertices with a full graph of  
four vertices is another full graph with five vertices; taking the  
disjoint union results in a graph with nine vertices and two  
components: a 5-clique and a 4-clique.

--
Tamas