「bipartite」の共起表現(2語右で並び替え)

Weblio 辞書 > 英和辞典・和英辞典 > bipartiteの意味・解説 > bipartiteに関連した共起表現

意味

例文

類語

共起表現

「bipartite」の共起表現一覧(2語右で並び替え)

該当件数 : 85件

In the	bipartite case, a quantum state is separable if and on
In any directed	bipartite graph, all cycles have a length that is divi
few important classes of graphs, such as all	bipartite graphs and most planar graphs except those w
And, a planar graph is	bipartite if and only if, in a planar embedding of the
um matchings and maximum weight matchings in	bipartite graphs and finding arborescences in directed
A graph is	bipartite if and only if it is 2-colorable, (i.e. its
rability graph, permutation graph, a chordal	bipartite graph, and chain graph.
For, in any	bipartite graph, any cycle must alternate between the
The line graphs of	bipartite graphs are perfect: in them, and in any of t
ture saying that the same holds not only for	bipartite graphs, but also for any loopless multigraph
Therefore, no directed	bipartite graph can be aperiodic.
	Bipartite graphs can model the more general multigraph
It is	bipartite, and can be constructed as the Levi graph of
hs with cochromatic number 2 are exactly the	bipartite graphs, complements of bipartite graphs, and
lds also for some special classes of graphs:	bipartite graphs, complements of bipartite graphs (tha
A	bipartite double cover is connected if and only if G i
The	bipartite double cover of any graph G is a bipartite g
For instance, below is an illustration of a	bipartite double cover of a non-bipartite graph G.
The	bipartite double cover is a special case of a double c
The	bipartite double cover of G has two vertices ui and wi
He has contributed to domination number,	bipartite double cover, and reconstruction theory.
An important special case is the	bipartite double cover, the derived graph of a voltage
If a planar graph is	bipartite and cubic but only 2-connected, then it may
Given a	bipartite graph, finding its complete bipartite subgra
s separating the two subsets form a complete	bipartite subgraph, forms two smaller graphs by replac
is even (that is, in this case, the graph is	bipartite) and four when k is odd.
ungbean yellow mosaic India virus (MYMIV), a	bipartite begomovirus from the family geminiviridae, i
is a partial cube, as is more generally any	bipartite Kneser graph H2n + 1, n.
The	bipartite Kneser graph Hn,k has as vertices the sets o
graph theory, the F26A graph is a symmetric	bipartite cubic graph with 26 vertices and 39 edges.
Folkman graph, named after Jon Folkman, is a	bipartite 4-regular graph with 20 vertices and 40 edge
ch(G) ≤ 3 if G is a	bipartite planar graph.
	bipartite regular graphs
Cartesian product of any pair of connected,	bipartite, d-valent graphs using a method that was lat
ecomposition, and because odd graphs are not	bipartite, they have chromatic number three: the verti
All such graphs are	bipartite, and hence can be colored with only two colo
This generalizes the concept of a	bipartite graph: if G is bipartite, and R is the set o
Any	bipartite graph is a subgraph of a complete bipartite
mathematical field of graph theory, a convex	bipartite graph is a bipartite graph with specific pro
It is known that k-choosability in	bipartite graphs is -complete for any k ≥ 3, and the s
nus consists of rod shaped viruses enclosing	bipartite (that is genes segmented into 2 parts), sing
e biadjacency matrix of a simple, undirected	bipartite graph is a (0,1)-matrix, and any (0,1)-matri
stating that the list chromatic index of any	bipartite multigraph is equal to its chromatic index.
One application of the Edmonds matrix of a	bipartite graph is that the graph admits a perfect mat
a semi-symmetric graph, the Folkman graph is	bipartite, and its automorphism group acts transitivel
A semi-symmetric graph must be	bipartite, and its automorphism group must act transit
The Herschel graph is also a	bipartite graph: its vertices can be separated into tw
Importin α contains a	bipartite NLS itself, which is specifically recognized
te graph on three vertices, and the complete	bipartite graph K1,3, which are not isomorphic but bot
In graph theory, a star Sk is the complete	bipartite graph K1,k, a tree with one internal node an
decomposed into cliques and stars (complete	bipartite graphs K1,q) by a split decomposition.
ntain the complete graph K5 nor the complete	bipartite graph K3,3 as a minor.
ither the complete graph K5 nor the complete	bipartite graph K3,3 as minors.
hs that are not planar, such as the complete	bipartite graph K3,3.
A complete	bipartite graph Km,n has a maximum independent set of
The laplacian matrix of a complete	bipartite graph Km,n has eigenvalues n+m, n, m, and 0;
A complete	bipartite graph Km,n has a vertex covering number of m
Edge-transitive graphs include any complete	bipartite graph Km,n, and any symmetric graph, such as
hat the list chromatic index of the complete	bipartite graph Kn,n equals n.
1 vertices, and the (r,4)-cage is a complete	bipartite graph Kr,r on 2r vertices.
te graph on five vertices) or K3,3 (complete	bipartite graph on six vertices, three of which connec
be shown to be NP-complete to test whether a	bipartite cubic polyhedron is Hamiltonian.
very two edges e and f on the same face of a	bipartite cubic polyhedron, there exists a Hamiltonian
A factor graph is a	bipartite graph representing the factorization of a fu
Consider a	bipartite quantum syste whose state space is the tenso
Because it is a	bipartite graph that has an odd number of vertices, th
to be the smallest integer k such that every	bipartite graph that has m vertices on one side of its
graph is a partial cube if and only if it is	bipartite and the relation Θ is transitive.
g a single Hamiltonian cycle from a complete	bipartite graph; the graph has edges connecting open s
As with any	bipartite graph, there are no odd-length cycles, and t
GQA]KKKK, is the prototype of the ubiquitous	bipartite signal: two clusters of basic amino acids, s
ojective geometry, Levi graphs are a form of	bipartite graph used to model the incidences between p
Consider a	bipartite graph where the vertices are partitioned int
The	bipartite graph where the partite sets differ in their
All complete	bipartite graphs which are trees are stars.
every multigraph is described entirely by a	bipartite graph which is one-sided regular of degree 2
ntially the same as the problem of finding a	bipartite subgraph with the most edges.
Let Ka,b denote a complete	bipartite graph with a vertices on one side of the bip
raph theory, the Gray graph is an undirected	bipartite graph with 54 vertices and 81 edges.
s design was one of Wright's first uses of a	bipartite design: with two portions of the building si
An (N, M, D, K, e)-disperser is a	bipartite graph with N vertices on the left side, each
e, because in this case the folded cube is a	bipartite graph with equal numbers of vertices on each
h as the rhombic dodecahedron, which forms a	bipartite graph with six degree-four vertices on one s

共起表現

「bipartite」の共起表現(2語右で並び替え) - Weblio英語共起表現検索

「bipartite」の共起表現一覧(2語右で並び替え)