首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5篇
  完全免费   1篇
  数学   6篇
  2020年   1篇
  2010年   1篇
  2002年   1篇
  2001年   1篇
  1992年   1篇
  1984年   1篇
排序方式: 共有6条查询结果,搜索用时 58 毫秒
1
1.
二面体群的小度数Cayley图的同构类的计数   总被引:1,自引:0,他引:1       下载免费PDF全文
设G是有限群,S是G的一个不包含单位元的非空子集且满足S-1=S,定义群G关于S一个的Cayley图x=Cay(G,S)如下:V(X)=G,E(X)={(g,sg)|g∈G,s∈S}.对于素数P,本文给出了2p阶的二面体群的3度和4度Cayley图的同构类的个数.  相似文献
2.
循环图已被用于平行计算,网络等方面.循环图研究的一个基本问题是对互不同构的循环图进行计数.对于给定的一个正整数n,用C(n,k)表示互不同构的具有几个顶点,度数为k的连通循环图的个数.文中给出了度数为 4和5的循环图的一般结构,并对n=paqb(p,q皆为素数,a,b>0),给出了C(n,4)的计算公式.  相似文献
3.
In the absence of four-factor and higher order interactions, we present a series of search designs for 2m factorials (m6) which allow the search of at most k (=1,2) nonnegligible three-factor interactions, and the estimation of them along with the general mean, main effects and two-factor interactions. These designs are derived from balanced arrays of strength 6. In particular, the nonisomorphic weighted graphs with 4 vertices in which two distinct vertices are assigned with integer weight (13), are useful in obtaining search designs for k=2. Furthermore, it is shown that a search design obtained for each m6 is of the minimum number of treatments among balanced arrays of strenth 6. By modifying the results for m6, we also present a search design for m=5 and k=2.  相似文献
4.
In this paper we prove an inverted version of A. J. Schwenk's result, which in turn is related to Ulam's reconstruction conjecture. Instead of deleting vertices from an undirected graphG, we add a new vertexv and join it to all other vertices ofG to get a perturbed graphG+v. We derive an expression for the characteristic polynomial of the perturbed graphG+v in terms of the characteristic polynomial of the original graphG. We then show the extent to which the characteristic polynomials of the perturbed graphs can be used in determining whether two graphs are non-isomorphic.This work was supported by the U.S. Army Research Office under Grant DAAG29-82-K-0107.  相似文献
5.
We present the method of proving the reconstructibility of graph classes based on the new type of decomposition of graphs — the operator decomposition. The properties of this decomposition are described. Using this decomposition we prove the following. Let P and Q be two hereditary graph classes such that P is closed with respect to the operation of join and Q is closed with respect to the operation of disjoint union. Let M be a module of graph G with associated partition (A,B,M), where AM and B⁄∼M, such that G[A]∈P, G[B]∈Q and G[M] is not (P,Q)-split. Then the graph G is reconstructible.  相似文献
6.
We study a noisy graph isomorphism problem, where the goal is to perfectly recover the vertex correspondence between two edge‐correlated graphs, with an initial seed set of correctly matched vertex pairs revealed as side information. We show that it is possible to achieve the information‐theoretic limit of graph sparsity in time polynomial in the number of vertices n. Moreover, we show the number of seeds needed for perfect recovery in polynomial‐time can be as low as in the sparse graph regime (with the average degree smaller than ) and in the dense graph regime, for a small positive constant . Unlike previous work on graph matching, which used small neighborhoods or small subgraphs with a logarithmic number of vertices in order to match vertices, our algorithms match vertices if their large neighborhoods have a significant overlap in the number of seeds.  相似文献
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号