Some results of bicoloured ordered trees

来源 :第六届全国组合数学与图论大会 | 被引量 : 0次 | 上传用户：fubaoran

【摘要】

：

An ordered tree can be defined inductively as an unlabelled rooted tree whose principal subtrees (the subtrees obtained by removing the root) are ordered trees

【作者】

：

Chunlin Liu

【机构】

：

DepartmentofMathematicsandSystemSciences,National,UniversityofDefenseTechnology,Changsha,Hunan410073

【出处】

：

第六届全国组合数学与图论大会

【发表日期】

：

2014年11期

下载到本地 , 更方便阅读

下载此文赞助VIP

声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架

论文部分内容阅读

An ordered tree can be defined inductively as an unlabelled rooted tree whose principal subtrees (the subtrees obtained by removing the root) are ordered trees and have been assigned a linear order (from left to right) among themselves.Ordered trees,non-nesting partitions, RNA secondary structures and many other combinatorial objects can be enumerated by Catalan numbers.

其他文献

An O(n) time algorithm for maximal line subgraph in a Halin graph

会议

Distance two labeling of the edge-path-replacement of a graph

In the channel assignment problem, we need to assign frequency bonds to transmitters, if two transmitters are too close, interference will occur if they attempt

会议

全国各地多措并举猛拉内需振经济

日前,适逢“五一”假期连休5天,也是我国进入常态化疫情防控阶段后的首个旅游小长假.假日期间,全国多地用别出心裁地发券、优惠和各类促销,趁假期实现有效的促进消费、拉动内

期刊

因子临界图的耳朵分解与最大匹配数

令G是一个连通图.如果对任意顶点v,G-v都有完美匹配,则称G是因子临界图.Lovasz证明每一个因子临界图都有耳朵分解.在本报告中将用因子临界图的耳朵分解解决最大匹配计数问题,

会议

Complex-L matrix and its recognition

A matrix is called a complex-L matrix if its complex sign pattern implies that it is of full column rank.The definition is a generalization of L-matrices from r

会议

生态环境保护需要科技支撑提升精准治污水平

本刊讯 (记者何云锋)近日,十三届全国人大常委会第十七次会议分组审议了国务院关于2019年度环境状况和环境保护目标完成情况与研究处理水污染防治法执法检查报告及审议意见

期刊

Quadratic unitary Cayley graphs of finite commutative rings

The adjacency matrix of a graph is the matrix with rows and columns indexed by its vertices such that the (i,j)-entry is equal to 1 if vertices i and j are adja

会议

Two new classes of binary sequence pairs with three-level cross-correlation

A pair of binary sequences is generalized from the concept of a two-level autocorrelation function of a single binary sequence.In this paper, we describe two cl

会议

Some results on the distance spectral characterization of graphs

Let G be a simple connected graph of order n and D(G) be the distance matrix of G.Suppose that λ1(D(G)) ≥ λ2(D(G)) ≥ … ≥ λn(D(G)) are the distance spectr

会议

Strong q-log-convexity of the Eulerian polynomials of Coxeter groups

In this paper we prove the strong q-log-convexity of the Eulerian polynomials of Coxeter groups using their exponential generating functions.Our proof is based

会议

Some results of bicoloured ordered trees

与本文相关的学术论文