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


小窓モード

プレミアム

ログイン
設定

設定

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

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

該当件数 : 100



It is bipartite, and can be constructed as the Levi graph of
All such graphs are bipartite, and hence can be colored with only two colo
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
If a planar graph is bipartite and cubic but only 2-connected, then it may
graph is a partial cube if and only if it is bipartite and the relation Θ is transitive.
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
In the bipartite case, a quantum state is separable if and on
graph theory, the F26A graph is a symmetric bipartite cubic graph with 26 vertices and 39 edges.
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
Cartesian product of any pair of connected, bipartite, d-valent graphs using a method that was lat
s design was one of Wright's first uses of a bipartite design: with two portions of the building si
directed hypergraph can be represented as a bipartite digraph.
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.
He has contributed to domination number, bipartite double cover, and reconstruction theory.
The bipartite double cover is a special case of a double c
An important special case is the bipartite double cover, the derived graph of a voltage
The bipartite double cover of G has two vertices ui and wi
Any bipartite graph is a subgraph of a complete bipartite
Therefore, no directed bipartite graph can be aperiodic.
mathematical field of graph theory, a convex bipartite graph is a bipartite graph with specific pro
A factor graph is a bipartite graph representing the factorization of a fu
Consider a bipartite graph where the vertices are partitioned int
hat the list chromatic index of the complete bipartite graph Kn,n equals n.
A complete bipartite graph Km,n has a maximum independent set of
hs that are not planar, such as the complete bipartite graph K3,3.
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.
A bipartite graph (U ∪ V, E) that is convex over both U
e biadjacency matrix of a simple, undirected bipartite graph is a (0,1)-matrix, and any (0,1)-matri
ojective geometry, Levi graphs are a form of bipartite graph used to model the incidences between p
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
The bipartite graph where the partite sets differ in their
In graph theory, a star Sk is the complete bipartite graph K1,k, a tree with one internal node an
Edge-transitive graphs include any complete bipartite graph Km,n, and any symmetric graph, such as
Because it is a bipartite graph that has an odd number of vertices, th
ntain the complete graph K5 nor the complete bipartite graph K3,3 as a minor.
One application of the Edmonds matrix of a bipartite graph is that the graph admits a perfect mat
to be the smallest integer k such that every bipartite graph that has m vertices on one side of its
An (N, M, D, K, e)-disperser is a bipartite graph with N vertices on the left side, each
1 vertices, and the (r,4)-cage is a complete bipartite graph Kr,r on 2r vertices.
e, because in this case the folded cube is a bipartite graph with equal numbers of vertices on each
ither the complete graph K5 nor the complete bipartite graph K3,3 as minors.
te graph on five vertices) or K3,3 (complete bipartite graph on six vertices, three of which connec
te graph on three vertices, and the complete bipartite graph K1,3, which are not isomorphic but bot
every multigraph is described entirely by a bipartite graph which is one-sided regular of degree 2
h as the rhombic dodecahedron, which forms a bipartite graph with six degree-four vertices on one s
Given a bipartite graph, finding its complete bipartite subgra
In any directed bipartite graph, all cycles have a length that is divi
For, in any bipartite graph, any cycle must alternate between the
As with any bipartite graph, there are no odd-length cycles, and t
A bipartite graph, (U ∪ V, E), is said to be convex over
rability graph, permutation graph, a chordal bipartite graph, and chain graph.
Example of a bipartite graph.
A cut is a bipartite graph.
A biquartic graph is a quartic bipartite graph.
isation of the Edmonds matrix for a balanced bipartite graph.
al star coloring is NP-hard even when G is a bipartite graph.
ethod used to create a maximal matching on a bipartite graph.
the problem is NP-complete even when G is a bipartite graph.
This generalizes the concept of a bipartite graph: if G is bipartite, and R is the set o
The Herschel graph is also a bipartite graph: its vertices can be separated into tw
g a single Hamiltonian cycle from a complete bipartite graph; the graph has edges connecting open s
bipartite graphs
Bipartite graphs can model the more general multigraph
All complete bipartite graphs which are trees are stars.
It is known that k-choosability in bipartite graphs is -complete for any k ≥ 3, and the s
few important classes of graphs, such as all bipartite graphs and most planar graphs except those w
decomposed into cliques and stars (complete bipartite graphs K1,q) by a split decomposition.
um matchings and maximum weight matchings in bipartite graphs and finding arborescences in directed
The line graphs of bipartite graphs are perfect: in them, and in any of t
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
ture saying that the same holds not only for bipartite graphs, but also for any loopless multigraph
f Eulerian circuits of complete and complete bipartite graphs.
And, a planar graph is bipartite if and only if, in a planar embedding of the
A graph is bipartite if and only if it is 2-colorable, (i.e. its
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
he score globally, rather than locally, in a bipartite matching (see complete bipartite graph).
-dimensional matching is a generalization of bipartite matching (a.k.a.
nomial-time algorithms for finding a maximum bipartite matching (maximum 2-dimensional matching), f
in better complexity upper bounds for planar bipartite matching.
stating that the list chromatic index of any bipartite multigraph is equal to its chromatic index.
Importin α contains a bipartite NLS itself, which is specifically recognized
ch(G) ≤ 3 if G is a bipartite planar graph.
Consider a bipartite quantum syste whose state space is the tenso
bipartite regular graphs
The bipartite selection (Fig 1 (C)) method was proposed by
GQA]KKKK, is the prototype of the ubiquitous bipartite signal: two clusters of basic amino acids, s
ntially the same as the problem of finding a bipartite subgraph with the most edges.
s separating the two subsets form a complete bipartite subgraph, forms two smaller graphs by replac
ecomposition, and because odd graphs are not bipartite, they have chromatic number three: the verti
                                                                                                   


こんにちは ゲスト さん

ログイン

Weblio会員(無料)になると

会員登録のメリット検索履歴を保存できる!

会員登録のメリット語彙力診断の実施回数増加!

無料会員に登録する
英→日 日→英
こんにちは ゲスト さん

ログイン

Weblio会員(無料)になると

会員登録のメリット検索履歴を保存できる!

会員登録のメリット語彙力診断の実施回数増加!

無料会員に登録する

©2024 GRAS Group, Inc.RSS