IsSimplicial - Maple Help
For the best experience, we recommend viewing online help using Google Chrome or Microsoft Edge.

Online Help

All Products    Maple    MapleSim


GraphTheory

  

IsSimplicial

  

determine if a vertex is simplicial

 

Calling Sequence

Parameters

Description

Definition

Examples

Compatibility

Calling Sequence

IsSimplicial(G, v)

Parameters

G

-

graph

v

-

vertex of the graph

Description

• 

IsSimplicial(G,v) returns true or false indicating whether the vertex v is simplicial.

Definition

• 

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.

Examples

(1)

(2)

(3)

(4)

Compatibility

• 

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