GraphTheory
IncidentEdges
find graph edges incident on a vertex
Calling Sequence
Parameters
Description
Examples
IncidentEdges(G, V, d)
G
-
graph or digraph
V
vertex or list of vertices
d
(optional) equation of the form direction=incoming or outgoing
IncidentEdges returns the set of edges (arcs) which are incident to a given vertices. If G is a directed graph, then the set of arcs which have a tail in the given list of vertices are returned.
IncidentEdges(G, V, direction=incoming) returns the set of arcs which have a head in the given set of vertices.
withGraphTheory:
G≔CycleGraph7
G≔Graph 1: an undirected graph with 7 vertices and 7 edge(s)
IncidentEdgesG,1
1,2,1,7
IncidentEdgesG,1,5,7
1,2,1,7,4,5,5,6,6,7
DG≔DigraphTrail1,2,3,4,5,3,Trail1,5,2,4,1
DG≔Graph 2: a directed graph with 5 vertices and 9 arc(s)
IncidentEdgesDG,2,3
2,3,2,4,3,4
IncidentEdgesDG,2,3,direction=incoming
1,2,2,3,5,2,5,3
See Also
AdjacencyMatrix
Degree
IncidenceMatrix
Neighbors
Trail
Download Help Document