Category:Complete bipartite graphs

From Wikimedia Commons, the free media repository
Jump to navigation Jump to search
<nowiki>grafo bipartito completo; teljes páros gráf; graf bipartit complet; vollständig bipartiter Graph; grafo bipartido completo; Đồ thị hai phía đầy đủ; گراف کامل دوبخشی; 完全二分图; 完全二分图; graf bipartit complet; 完全2部グラフ; полный двудольный граф; กราฟสองส่วนบริบูรณ์; Komplett bipartit graf; popolni dvodelni graf; повний дводольний граф; 完全二部圖; 完全二分圖; graphe biparti complet; 完全二分圖; 완전 이분 그래프; complete bipartite graph; Plena dukolora grafeo; úplný bipartitní graf; grafo bipartito completo; вид двудольного графа, у которого любая вершина первой доли соединена со всеми вершинами второй доли вершин; graphe biparti qui contient le nombre maximal d'arêtes; every vertex of first set attached to every vertex of second set; graf, jehož každý vrchol z podmnožiny vrcholů je spojen se všemi vrcholy ze zbytku množiny vrcholů; matematikai fogalom a gráfelméletben; grafo completo bipartido; 完全二部圖; گراف کامل دو بخشی; 完全二部图; биклика; biclique; Dukliko; úplný dvoudílný graf; úplný sudý graf; graf complet bipartit</nowiki>
complete bipartite graph 
every vertex of first set attached to every vertex of second set
Upload media
Subclass of
  • bipartite graph
  • biregular graph
  • Hamiltonian graph
  • cograph
  • chordal bipartite graph
Authority file
Edit infobox data on Wikidata

A complete bipartite graph or biclique in the mathematical field of graph theory is a special kind of bipartite graph where every vertex of the first set is connected to every vertex of the second set.

Subcategories

This category has the following 3 subcategories, out of 3 total.

Media in category "Complete bipartite graphs"

The following 35 files are in this category, out of 35 total.