Bounds on the clique-transversal number of regular graphs

来源 :中国科学:数学英文版 | 被引量 : 0次 | 上传用户:beyondryo
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
A clique-transversal set D of a graph G is a set of vertices of G such that D meets all cliques of G.The clique-transversal number,denoted Tc(G),is the minimum cardinality of a clique- transversal set in G.In this paper we present the bounds on the clique
其他文献
Soliton solutions, rational solutions, Matveev solutions, complexitons and interaction solutions of the AKNS equation are derived through a matrix method for co
We consider a modified Markov branching process incorporating with both state-independent immigration-migration and resurrection. The effect of state-independen
Multivariate failure time data arise frequently in survival analysis.A commonly used tech-nique is the working independence estimator for marginal hazard models
在这份报纸,我们为旋转 c Dirac-Witten 操作员的特征值得到最佳的更低的界限。这些估计作为分级的弯曲,使不安的 Yamabe 操作员的第一个特征值和 spinorial 精力动量张肌以吝
In this paper, we establish some Rosenthal type inequalities for maximum partial sums of asymptotically almost negatively associated random variables, which ext
We consider a singular perturbation problem which describes 2D Darcy-Stokes flow.An H(div)-conforming rectangular element,DS-R14,is proposed and analyzed frst.T
This article considers a semiparametric varying-coefficient partially linear regression model.The semiparametric varying-coefficient partially linear regression
Let r 3, n r and π = (d1, d2, . . . , dn) be a graphic sequence. If there exists a simple graph G on n vertices having degree sequence π such that G contains
Using the framework of formal theory of partial differential equations, we consider a method of computation of the bi-Hilbert polynomial (i.e. Hilbert polynomia
In this note we first briefly review some recent progress in the study of the circular β ensemble on the unit circle,where β 】 0 is a model parameter.In the