Lesson plan
Bisplit graph
In graph theory, a bisplit graph is an undirected graph whose vertices can be partitioned into two subsets, one of which is an independent set and the other of which induces a complete bipartite graph (a biclique). They are defined analogously to split graphs, in which the vertices can be partitioned into an independent set and a complete subgraph. A weak bisplit graph generalizes the definition of a bisplit graph by allowing a partition into an independent set and a disjoint union of bicliques.
Article summary
In graph theory, a bisplit graph is an undirected graph whose vertices can be partitioned into two subsets, one of which is an independent set and the other of which induces a complete bipartite graph (a biclique). They are defined analogously to split graphs, in which the vertices can be partitioned into an independent set and a complete subgraph. A weak bisplit graph generalizes the definition of a bisplit graph by allowing a partition into an independent set and a disjoint union of bicliques.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.