Matches in DBpedia 2016-04 for { ?s ?p "In the mathematical field of graph theory, a convex bipartite graph is a bipartite graph with specific properties.A bipartite graph, (U ∪ V, E), is said to be convex over the vertex set U if U can be enumerated such that for all v ∈ V the vertices adjacent to v are consecutive.Convexity over V is defined analogously. A bipartite graph (U ∪ V, E) that is convex over both U and V is said to be biconvex or doubly convex."@en }
Showing triples 1 to 4 of
4
with 100 triples per page.
- Convex_bipartite_graph abstract "In the mathematical field of graph theory, a convex bipartite graph is a bipartite graph with specific properties.A bipartite graph, (U ∪ V, E), is said to be convex over the vertex set U if U can be enumerated such that for all v ∈ V the vertices adjacent to v are consecutive.Convexity over V is defined analogously. A bipartite graph (U ∪ V, E) that is convex over both U and V is said to be biconvex or doubly convex.".
- Q5166515 abstract "In the mathematical field of graph theory, a convex bipartite graph is a bipartite graph with specific properties.A bipartite graph, (U ∪ V, E), is said to be convex over the vertex set U if U can be enumerated such that for all v ∈ V the vertices adjacent to v are consecutive.Convexity over V is defined analogously. A bipartite graph (U ∪ V, E) that is convex over both U and V is said to be biconvex or doubly convex.".
- Convex_bipartite_graph comment "In the mathematical field of graph theory, a convex bipartite graph is a bipartite graph with specific properties.A bipartite graph, (U ∪ V, E), is said to be convex over the vertex set U if U can be enumerated such that for all v ∈ V the vertices adjacent to v are consecutive.Convexity over V is defined analogously. A bipartite graph (U ∪ V, E) that is convex over both U and V is said to be biconvex or doubly convex.".
- Q5166515 comment "In the mathematical field of graph theory, a convex bipartite graph is a bipartite graph with specific properties.A bipartite graph, (U ∪ V, E), is said to be convex over the vertex set U if U can be enumerated such that for all v ∈ V the vertices adjacent to v are consecutive.Convexity over V is defined analogously. A bipartite graph (U ∪ V, E) that is convex over both U and V is said to be biconvex or doubly convex.".