We show that the problem of deciding whether the edge set of a bipartite graph can be partitioned into three matchings, of size k1, k2 and k3 is NP-complete, even if one of the matchings is required to be perfect. We also show that the problem of deciding whether the edge set of ...
3. Cocktail party graphs CP(n)=K2n-nK2 and complete bipartite graphs Ka,a all are integral graphs[1]. 鸡尾酒会图CP(n)=K2n-nK2(K2n是2n阶完全图)和完全二部图Ka,a都是整谱图。 更多例句>> 6) complement of bipartite graph 二部完全图补充...
bipartite graph K2m,2m, or s = 2 and Γ is a normal cover of one of the following 2-transitive graphs: Kpm+1 (the complete graph of order pm ... Li,Cai,Heng - 《Bulletin of the London Mathematical Society》 被引量: 32发表: 2001年 Classification of 2-arc-transitive dihedrants A...
and Taraz [Math. Ann., 343 (2009), pp. 175-205], implies that for any γ > 0, every balanced bipartite graph on 2n vertices with bounded degree and sublinear bandwidth appears as a subgraph of any 2n-vertex graph G with minimum degree (l + γ)n, provided that n is sufficiently ...
K2is bipartite, but Kn is not bipartite for n = 2. ... Cn for n ≥ 3 is bipartite iff n is even. Is every acyclic undirected graph bipartite? All Acyclic1graphs are bipartite. ... A cyclic2graph is bipartite iff all its cycles are of even length. ...
Fig. 3 Overview of the batch process for the nLB classifier. With random sampling a subset of the bigraph is selected. The projection is created for each batch, to calculate a part of the class vector. Subsequently, we assemble all the partial vectors into a whole class vector that is us...
在现实世界中,这样的图通常与丰富的属性相关联,例如,社交网络中的用户概况,网络图中的网页内容,癌症信号网络中的通路标志以及学术图中的论文关键词,这些被称为属性二部图(attribuated bipartite graph,以下简称ABGs)。 给定一个属性二部图GG两个不相交的节点集UU和VV,𝑘-Attributed Bipartite Graph Clustering (...
They conjectured that every n-vertex (B+3)-graph has much more than 5n/3 edges, presented (B+3)-graphs with 2n3 edges, and suggested that perhaps 2n is the asymptotically best lower bound. We prove that indeed every (B+3)-graph has at least 2n3 edges. 展开 ...
Let nk2 be positive integers, k|n. Let <###next line###>k be the cyclic group of order k. Denote by <###next line###> the minimal integer t such that for every <###next line###>k-coloring of the edges of Kt, (i.e., a function <###next li... Y Caro - 《Discrete...
3.Cocktail party graphs CP(n)=K2n-nK2 and complete bipartite graphs Ka,a all are integral graphs[1].鸡尾酒会图CP(n)=K2n-nK2(K2n是2n阶完全图)和完全二部图Ka,a都是整谱图。 3)complement of bipartite graph二部完全图 4)complete balanced bipartite graph完全等二部图 1.In this paper,th...