Automorphisms of Cayley Digraph of 2-genetic Groups of Prime-power Order

来源 :第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The | 被引量 : 0次 | 上传用户:moxiaomi521
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  A group is called 2-genetic if each normal subgroup of the group can be generated by two elements.For an odd prime p and a positive integer n,let G be a nonabelian 2-genetic group of order pn,and let Cay(G,S)be a connected Cayley digraph.
其他文献
  Treewidth is a graph parameter of fundamental importance in graph minor theory,with numerous applications in algorithmic theory and practical computing.In t
会议
  Corrádi and Hajnal[On the maximal number of independent circuits in a graph,Acta Math.Acad.Sci.Hungar.14(1963),423-439] investigated the maximum number of
会议
  Let G be a graph and λ1≥λ2≥…≥λn the eigenvalues of G.The energy E(G)of G is defined as ∑nk=1|λk|.A well-known result on the energy of graphs is the
会议
  This presentation research some new special combination sequence.We give a probabilistic proof of generalized harmonic numbers H(r)n,and obtain the probabil
会议
  The convolution array is a matrix whose nth column is the n-fold convolution for the 0th column.In this talk,we evaluate two truncated determinants of convo
会议
  阐述(V,R)-语言、(V,R)-半群、拟简单图以及拟严格有向图等概念,建立(V,R)-语言、(V,R)-半群、互联网络与拟简单图、拟严格有向图以及随机图的关系,进而,以上领域互为工
会议
  A perfect matching cover of a graph G is a set of perfect matchings of G such that each edge of G is contained in at least one member of it.Berge conjecture
会议
  Many classical graph partitioning problems ask for partitions of a graph(or a hypergraph)that optimize a single quantity.In judicious partitioning problems,
会议
  In this paper we deduce a necessary and sufficient condition for those graphs whose Mycielski graphs are planar.In addition,we deduce a necessary and suffic
会议
  An edge-colored graph H is called rainbow if e(H)= c(H),where e(H)is the number of edges in G and c(H)is the number of colors used.The rainbow number rb(G,H
会议