961
个编辑
更改
跳到导航
跳到搜索
第7行：
第7行： − + − A [[complete bipartite graph with m = 5 and n = 3]]+ − − m=5和n=3的完全二分图示例 − 第18行：
第15行： − + +
无编辑摘要
[[文件:Example of a bipartite graph without cycles.png|缩略图|无环二分图示例]]
[[文件:Example of a bipartite graph without cycles.png|缩略图|无环二分图示例]]
[[File:Biclique K 3 5.svg|thumbnail|A [[complete bipartite graph]] with m = 5 and n = 3]]
[[文件:Biclique K 3 5.svg.png|缩略图|m=5和n=3的完全二分图示例]]
--[[用户:趣木木|趣木木]]（[[用户讨论:趣木木|讨论]]）注意图的格式规范 查看之前发的表/链接页面 已改
--[[用户:趣木木|趣木木]]（[[用户讨论:趣木木|讨论]]）注意图的格式规范 查看之前发的表/链接页面
In the [[mathematics|mathematical]] field of [[graph theory]], a '''bipartite graph''' (or '''bigraph''') is a [[Graph (discrete mathematics)|graph]] whose [[vertex (graph theory)|vertices]] can be divided into two [[disjoint sets|disjoint]] and [[Independent set (graph theory)|independent sets]] <math>U</math> and <math>V</math> such that every [[edge (graph theory)|edge]] connects a vertex in <math>U</math> to one in <math>V</math>. Vertex sets <math>U</math> and <math>V</math> are usually called the ''parts'' of the graph. Equivalently, a bipartite graph is a graph that does not contain any odd-length。
In the [[mathematics|mathematical]] field of [[graph theory]], a '''bipartite graph''' (or '''bigraph''') is a [[Graph (discrete mathematics)|graph]] whose [[vertex (graph theory)|vertices]] can be divided into two [[disjoint sets|disjoint]] and [[Independent set (graph theory)|independent sets]] <math>U</math> and <math>V</math> such that every [[edge (graph theory)|edge]] connects a vertex in <math>U</math> to one in <math>V</math>. Vertex sets <math>U</math> and <math>V</math> are usually called the ''parts'' of the graph. Equivalently, a bipartite graph is a graph that does not contain any odd-length。
In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets {\displaystyle U}U and {\displaystyle V}V such that every edge connects a vertex in {\displaystyle U}U to one in {\displaystyle V}V. Vertex sets {\displaystyle U}U and {\displaystyle V}V are usually called the parts of the graph. Equivalently, a bipartite graph is a graph that does not contain any odd-length cycles.[1][2]
In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets {\displaystyle U}U and {\displaystyle V}V such that every edge connects a vertex in {\displaystyle U}U to one in {\displaystyle V}V. Vertex sets {\displaystyle U}U and {\displaystyle V}V are usually called the parts of the graph. Equivalently, a bipartite graph is a graph that does not contain any odd-length cycles.[1][2]
在图论的数学领域中，'''<font color="#ff8000"> 二分图Bipartite graph</font>'''（或二部图）内的所有顶点可以分为两个不相交且独立的集合U和集合V，并且每个连边（无向或有向）的两个顶点分别在集合U和集合V当中。通常集合U和集合V被称为该二分图的子集。同时，二分图中不包含任何形式的奇数环，即：集合U和集合V构造的点集所形成的循环圈边数不为奇数。
在图论的数学领域中，'''<font color="#ff8000"> 二分图Bipartite graph</font>'''（或二部图）内的所有顶点可以分为两个不相交且独立的集合''U''和集合''V''，并且每个连边（无向或有向）的两个顶点分别在集合''U''和集合''V''当中。通常集合''U''和集合''V''被称为该二分图的子集。同时，二分图中不包含任何形式的奇数环，即：集合''U''和集合''V''构造的点集所形成的循环圈边数不为奇数。
--[[用户:趣木木|趣木木]]（[[用户讨论:趣木木|讨论]]）变量斜体
--[[用户:趣木木|趣木木]]（[[用户讨论:趣木木|讨论]]）变量斜体