The Truncated Determinants of Convolution Arrays

来源 :第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The | 被引量 : 0次 | 上传用户:xxp520
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  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 convolution arrays,which are conjectured by Hoggatt and Bicknell.
其他文献
  A gc-coloring of a graph G is an edge-coloring of G such that each color appears at each vertex at least g(v)times.The maximum integer k such that G has a g
会议
  Anti-Kekulé problem is a concept of chemical graph theory precluding the Kekulé structure of the molecules.Matching preclusion and conditional matching pr
会议
  A tree is called double starlike if it has exactly two vertices of degree greater than two.Let H(p,n,q)denote the double starlike tree obtained by attaching
会议
  Let G be a graph,B(G),Bc(G),BS(G),BSc(G)and C(G)be the band-width,cyclic bandwidth,bandwidth sum,cyclic bandwidth sum and cutwidth of G,respectively.
会议
  An r-acyclic edge coloring of a graph G is a proper edge coloring such that any cycle C has at least min{|C|,r} colors.The least number of colors needed for
会议
  The genus distribution of a graph G is defined to be the sequence {gm},where gm is the number of di erent embeddings of G in the closed orientable surface o
会议
  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
会议