test if graph is a split graph
(optional) equation of the form decomposition=true or decomposition=false
decomposition : keyword option of the form decomposition=true or decomposition=false.
Specifies whether the decomposition into a maximum clique and an independent set should be returned when the graph is a split graph. If true, the result is an expression sequence whose second element is a two-element list containing a maximum clique and an independent set when G is a split graph. The default is false.
IsSplitGraph(G) returns true if G is a split graph and false otherwise.
An undirected graph G is a split graph if its vertices can be partitioned into a clique and an independent set. The partition is not guaranteed to be unique.
Split graphs are closed under graph complement.
Every split graph is a chordal graph.
K ≔ Graph⁡5,1,2,1,3,2,3,3,4,2,4,4,5
K≔Graph 1: an undirected graph with 5 vertices and 6 edge(s)
P ≔ PathGraph⁡4
P≔Graph 2: an undirected graph with 4 vertices and 3 edge(s)
G ≔ SpecialGraphs:-PetersenGraph⁡
G≔Graph 3: an undirected graph with 10 vertices and 15 edge(s)
The GraphTheory[IsSplitGraph] command was introduced in Maple 2020.
For more information on Maple 2020 changes, see Updates in Maple 2020.
Download Help Document
What kind of issue would you like to report? (Optional)