edge graph 
Recurrence and transience of the edge graph of a tiling of the euclidean plane


The algorithms use characterizations of adjacent vertices in network and dual network LP's to perform an efficient traversal of the edge graph of the polyhedron.


Strong isoperimetric inequality for the edge graph of a tiling of the plane


We introduce a new kind of graph called "multiedge graph" which arises in many applications such as finite state Markov chains and broadcasting communication networks.


We give two algorithms to partition a multiedge graph into maximal clusters.


As an example, observe that K4 is the edge graph of a tetrahedron.


Let R be the set of adjacent vertices to bj on the edge graph of B.


Let R be the vertices adjacent to ai on the edge graph of A.


NodePortEdge graph model that is powerful enough for the vast majorityof connected graph applications.


Some nodes or edges can be merged and others can be removed in the output edge graph.


The city is stored as a wingededge graph, with edges in the graph representing streets, and faces representing city blocks.


The emphasized edges belong to the lastedge graph determined by the corresponding edge ordering.


The problem of finding the minimal edge graph on n nodes that is kconnected is a well studied problem in graph theory.


The triples form a directed, labellededge graph, with the subjects and objects forming the nodes and the predicates the edges.


Underlined edges belong to the lastedge graph determined by the ordering.

