Hadoop Online Training by Edureka

linegraph: Linegraph of a graph

Description Usage Arguments Value Author(s) See Also Examples

Description

(From Wikipedia) The line graph L(G) of an undirected graph G is another graph L(G) that represents the adjacencies between edges of G. By definition, each vertex of L(G) represents an edge of G, and two vertices of L(G) are adjacent if and only if their corresponding edges share a common endpoint ("are adjacent") in G.

Usage

1
linegraph(graph, sep = ":")

Arguments

graph

Undirected graph of class graph.

sep

Separates the node names of G in the node names of the new graph L(G).

Value

graphNEL object.

Author(s)

Adrian Waddell and R. Wayne Oldford

See Also

navGraph, completegraph, newgraph

Examples

1
2
G <- completegraph(LETTERS[1:4])
LG <- linegraph(G, sep = "xx")


Search within the RnavGraph package
Search all R packages, documentation and source code

Questions? Problems? Suggestions? or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.