|
networks[vdegree] - finds vertex degrees in a graph
|
|
Calling Sequence
|
|
vdegree(vname, G)
|
|
|
Parameters
|
|
|
G
|
-
|
graph or network
|
|
vname
|
-
|
vertex
|
|
|
|
|
|
Description
|
|
|
•
|
Given a vertex v the degree of v in G is returned.
|
|
•
|
Undirected and directed edges may both exist, but vdegree uses only the undirected edges. Use indegree() or outdegree() to determine the other kinds of degrees.
|
|
•
|
This routine is normally loaded via the command with(networks) but may also be referenced using the full name networks[vdegree](...).
|
|
|
|
Examples
|
|
Important: The networks package has been deprecated.Use the superseding package GraphTheory instead.
|
>
|
|
|
>
|
|
|
>
|
|
|
>
|
![addedge([{1, 2}, {1, 2}, [1, 2], [1, 3], [4, 1]], G)](/support/helpjp/helpview.aspx?si=8257/file07449/math109.png)
|
|
>
|
|
|
| (1) |
|
>
|
|
|
| (2) |
|
>
|
|
|
| (3) |
|
|
Download Help Document
Was this information helpful?
