Bipartite
101Gallery of named graphs — Some of the finite structures considered in graph theory have names, sometimes inspired by the graph s topology, and sometimes after their discoverer. A famous example is the Petersen graph, a concrete graph on 10 vertices that appears as a… …
102Hopcroft–Karp algorithm — The Hopcroft–Karp algorithm finds maximum cardinality matchings in bipartite graphs in O(sqrt{V} E) time, where V is the number of vertices and E is the number of edges of the graph. [John E. Hopcroft, Richard M. Karp: An n^{5/2} Algorithm for… …
103Triangle-free graph — In the mathematical area of graph theory, a triangle free graph is an undirected graph in which no three vertices form a triangle of edges. Triangle free graphs may be equivalently defined as graphs with clique number ≤ 2, graphs with girth ≥ 4,… …
104Edmonds matrix — In graph theory, the Edmonds matrix A of a balanced bipartite graph G(U, V, E) with sets of vertices U = {u 1, u 2, dots , u n } and V = {v 1, v 2, dots , v n} is defined by : A {ij} = left{ egin{array}{ll} x {ij} (u i, v j) in E 0 (u i, v j)… …
105Fundamental modeling concepts — (FMC) provide a framework to describe software intensive systems. It strongly emphasizes the communication about software intensive systems by using a semi formal graphical notation that can easily be understood. Introduction FMC distinguishes… …
106Mung bean yellow mosaic virus — (MYMV) Virus classification Group: II: The ssDNA viruses Family: Geminiviridae Genus: Begomovirus …
107Pseudoforest — A 1 forest (a maximal pseudoforest), formed by three 1 trees In graph theory, a pseudoforest is an undirected graph[1] in which every connected component has at most one cycle. That is, it is a system of vertices and edges connecting pairs of ve …
108Zinc finger chimera — Zinc finger protein chimera are chimeric proteins composed of a DNA binding zinc finger protein domain and another domain through which the protein exerts its effect. The effector domain may be a transcriptional activator (A) or repressor… …
109Crossing number (graph theory) — A drawing of the Heawood graph with three crossings. This is the minimum number of crossings among all drawings of this graph, so the graph has crossing number cr(G) = 3. In graph theory, the crossing number cr(G) of a graph G is the… …
110Hypohamiltonian graph — In the mathematical field of graph theory, a graph G is said to be hypohamiltonian if G does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian.HistoryHypohamiltonian graphs were first… …
