plots,graphplot3d - Maple Help

plots

 graphplot3d
 plot an undirected graph in 3-D

 Calling Sequence graphplot3d(G, eigenopts, opts)

Parameters

 G - real symmetric Matrix eigenopts - (optional) specifies vertex numbers opts - equations of form option=value

Description

 • Important: The plots[graphplot3d] command has been deprecated. Use the superseding command GraphTheory[DrawGraph] instead.
 • This routine draws an undirected graph $G=\left(V,E\right)$ in three dimensions in such a way that structure and symmetry in the graph is revealed.  The graph G is input as an adjacency matrix, that is, a real symmetric matrix. The output is a three-dimensional plot of labeled points and lines connecting them.  The points correspond to the vertices in the graph and the lines correspond to the edges in the graph, that is, there will be a line connecting point i with point j when ${G}_{i,j}$ is nonzero.
 • The location of the vertices of the graph is determined as follows. Let $u$, $v$, and $w$ be three eigenvectors of G with corresponding second, third, and fourth largest eigenvalue in absolute value.  Then the (x,y,z) co-ordinates of the ith vertex of G is (${u}_{i},{v}_{i},{w}_{i}$).
 • Sometimes other symmetries in the graph may be seen by using the other eigenvectors. If the optional argument $\mathrm{eigenvectors}=\left[\mathrm{e1},\mathrm{e2},\mathrm{e3}\right]$ is specified, where e1, e2, e3 are vertex numbers (integers from 1 through the number of vertices) then the eigenvectors corresponding to the eigenvalues of these relative magnitudes are used.
 • Remaining arguments are interpreted as options which are specified as equations of the form option = value. The remaining options are the same as those available for the plot3d command. See plot3d[option] for further information.

Examples

Important: The plots[graphplot3d] command has been deprecated. Use the superseding command GraphTheory[DrawGraph] instead.

 > $\mathrm{with}\left(\mathrm{plots}\right):$
 > $\mathrm{cube}≔\mathrm{Matrix}\left(8,8,\mathrm{shape}=\mathrm{symmetric}\right):$
 > $\mathrm{cube}\left[1,2\right]≔1:$$\mathrm{cube}\left[2,3\right]≔1:$$\mathrm{cube}\left[3,4\right]≔1:$$\mathrm{cube}\left[1,4\right]≔1:$
 > $\mathrm{cube}\left[5,6\right]≔1:$$\mathrm{cube}\left[6,7\right]≔1:$$\mathrm{cube}\left[7,8\right]≔1:$$\mathrm{cube}\left[5,8\right]≔1:$
 > $\mathrm{cube}\left[1,5\right]≔1:$$\mathrm{cube}\left[2,6\right]≔1:$$\mathrm{cube}\left[3,7\right]≔1:$$\mathrm{cube}\left[4,8\right]≔1:$
 > $\mathrm{graphplot3d}\left(\mathrm{cube}\right)$
 > $\mathrm{cp}≔\mathrm{factor}\left(\mathrm{LinearAlgebra}:-\mathrm{CharacteristicPolynomial}\left(\mathrm{cube},x\right)\right)$
 ${\mathrm{cp}}{≔}\left({x}{-}{3}\right){}\left({x}{+}{3}\right){}{\left({x}{-}{1}\right)}^{{3}}{}{\left({x}{+}{1}\right)}^{{3}}$ (1)
 > $\mathrm{graphplot3d}\left(\mathrm{cube},\mathrm{eigenvectors}=\left[1,3,8\right]\right)$
 > $\mathrm{with}\left(\mathrm{networks}\right):$
 > $G≔\mathrm{dodecahedron}\left(\right):$
 > $A≔\mathrm{adjacency}\left(G\right)$
 > $\mathrm{graphplot3d}\left(A,\mathrm{title}="A dodecahedron"\right)$