GraphTheory
IsSimplicial
determine if a vertex is simplicial
Calling Sequence
Parameters
Description
Definition
Examples
Compatibility
IsSimplicial(G, v)
G
-
graph
v
vertex of the graph
IsSimplicial(G,v) returns true or false indicating whether the vertex v is simplicial.
A vertex v is simplicial if the subgraph induced by v and its neighbors forms a clique. That is, every pair of vertices which are both neighbors of v are also neighbors of each another.
The GraphTheory[IsSimplicial] command was introduced in Maple 2022.
For more information on Maple 2022 changes, see Updates in Maple 2022.
See Also
CompleteGraph
IsClique
Download Help Document