共查询到20条相似文献,搜索用时 62 毫秒
1.
2.
n圈中辐图的团覆盖数和团划分数 总被引:1,自引:0,他引:1
本主要讨论Petersen图的一类推广图-n圈中辐图的团覆盖数和团划分数,由此得出该图的团覆盖数和团划分数相等的结论,同时给出了其在不同情况下的计算公式。 相似文献
3.
本文主要讨论 Petersen图的一类推广图—— n圈中辐图的团覆盖数和团划分数 ,由此得出该图的团覆盖数和团划分数相等的结论 ,同时给出了其在不同情况下的计算公式 . 相似文献
4.
5.
路与完全图的笛卡尔积图和广义图K(n,m)的关联色数 总被引:4,自引:0,他引:4
Richrd A.Brualdi和J.Quinn Massey在[1]中引入了图的关联着色概念,并且提出了关联着色猜想,即每一个图G都可以用△(G)+2种色正常关联着色.B.Guiduli[2]说明关联着色的概念是I.Algor和N.Alon[3]提出的有向星荫度的一个特殊情况,并证实[1]的关联着色猜想是错的,给出图G的关联色数的一个新的上界是△(G)+O(Log(△G)).[4]确定了某些特殊图类的关联色数.本文给出了路和完全图的笛卡尔积图的关联色数,而且利用此结果又确定了完全图Kn的广义图K(n,m)的关联色数. 相似文献
6.
7.
关于Gauss-Turán求积公式的注记 总被引:2,自引:0,他引:2
1.引言 设w(x)是区间[-1,1]上的权函数,N是自然数集,X1,…,Xn(n∈N)是对应于权函数w(x)的n次正交多项式的零点,则具有最高代数精度2n-1,其中Πn表示所有次数≤n的多项式空间. 1950年,Turan[1]将上述经典的Gauss求积公式予以推广,证明了,若 相似文献
8.
9.
图G(V,E)的一个正常k-全染色σ称为G(V,E)的一个k-点强全染色,当且仅当v∈V(G),N[v]中的元素着不同颜色,其中N[v]={u vu∈V(G)}∪{v};并且χvTs(G)=m in{k存在G的一个k-点强全染色}称为G的点强全色数.本文确定了完全图Kn的广义图K(n,m)和乘积图Lm×Kn的点强全色数. 相似文献
10.
11.
12.
13.
14.
15.
16.
Let be the -dimensional complex projective space, and let be two non-empty open subsets of in the Zariski topology. A hypersurface in induces a bipartite graph as follows: the partite sets of are and , and the edge set is defined by if and only if . Motivated by the Turán problem for bipartite graphs, we say that is -grid-free provided that contains no complete bipartite subgraph that has vertices in and vertices in . We conjecture that every -grid-free hypersurface is equivalent, in a suitable sense, to a hypersurface whose degree in is bounded by a constant , and we discuss possible notions of the equivalence.We establish the result that if is -grid-free, then there exists of degree in such that . Finally, we transfer the result to algebraically closed fields of large characteristic. 相似文献
17.
18.
19.
《Discrete Mathematics》2022,345(10):112997
The generalized Turán number ex is defined to be the maximum number of copies of a complete graph in any H-free graph on n vertices. Let F be a linear forest consisting of k paths of orders . By characterizing the structure of the F-free graph with large minimum degree, we determine the value of ex for and except some , and the corresponding extremal graphs. Our result confirms a conjecture, due to Yuan and Zhang (2021), on classical Turán number of any linear forest for and each , and improves some known results on classical Turán number of linear forest. 相似文献
20.
Given two graphs and , the maximum possible number of copies of in an -free graph on vertices is denoted by . We investigate the function , where denotes vertex disjoint copies of a fixed graph . Our results include cases when is a complete graph, cycle or a complete bipartite graph. 相似文献