In the mathematical field of graph theory, a convex bipartite graph is a bipartite graph with specific properties. A bipartite graph ( U ∪ V , E ) {\displaystyle (U\cup V,E)} is said to be convex over the vertex set U {\displaystyle U} if U {\displaystyle U} can be enumerated such that for all v ∈ V {\displaystyle v\in V} , the vertices adjacent to v {\displaystyle v} are consecutive in the enumeration.
In the mathematical field of graph theory, a convex bipartite graph is a bipartite graph with specific properties. A bipartite graph ( U ∪ V , E ) {\displaystyle (U\cup V,E)} is said to be convex over the vertex set U {\displaystyle U} if U {\displaystyle U} can be enumerated such that for all v ∈ V {\displaystyle v\in V} , the vertices adjacent to v {\displaystyle v} are consecutive in the enumeration.
Source: Wikipedia "Convex bipartite graph" · CC BY-SA 4.0
Share this article: X · Bluesky