本质集的邻域并和无爪图的哈密尔顿性

设G是一个图 ,G的独立集Y称为本质集 ,如果存在 {y1,y2 } Y ,使得dist(y1,y2 ) =2 .本文利用插点方法 ,给出了关于k或 (k + 1)连通 (k≥ 2 )无爪图G是哈密尔顿的或 1哈密尔顿的统一的证明 .2个结果的充分条件是关于 ∑ki=0N(Yi) 与n(Y)的不等式 ,这里Y是图G的任一本质集 ,对于i∈ { 0 ,1,… ,k} ,Yi={y1,yi- 1,… ,yi- (b- 1) } Y(yj 的下标将取模k + 1) ;b是一个整数 ,且 0 相似文献   

浅谈如何做好机械制图的教学

《机械制图》是机械专业的第一门专业基础课,本门课程掌握的好坏直接影响到以后其他专业课的学习。结合几年的教学实践,就如何做好课程的教学工作进行分析、探讨。     

Longest Paths and Cycles in Connected Claw-Free Graphs

A graph is called claw-free if it does not contain a claw as its induced subgraph. In this paper, we prove the following results : 1 ) If G is a 2-connected claw-free graph on n vertices, then for any vertex υ and any two distinct vertices x and y in V(G) - |υ| , G has a path containing v and all neighbors of v and connecting x and y;2) Let C be the longest cycle in a 3-connected claw-free graph G and H a component of G - C,and if H is connected but not 2-connected, then there exist nonadjacent vertices u and v in H such that |V(C)| ≥3(d(u) d(u)) -2.     

On Symmetric Graphs of Prime Valency

In this paper, we first survey some researches on the characterization of connected symmetric graphs of valency 2p,3p, p a prime, then we summarize the results on the characterization of symmetric graphs of prime valency.     

Fishy Statistics

Being a statistical detective can provide a strong motivation for early work in data handling. Media reports can often start a fascinating chain of events, as this article shows.     

Allocation of fixed transmission cost based on power flow tracing algorithm

1 Introduction a In the electricity market, because the calculation of the traditional spot electricity price according to node transmission charging is based upon short-run marginal cost, it is impossible to recover the great one-off investment of the transmission network, and this results in the payment imbalance of the electric network. Therefore, such spot electricity price goes against and its modification is indispensable to the development of the power system, and it is necessary to mod…     

A Bilevel Decision Method for the Multiobjective Problem with 01 Variables

ＡＢｉｌｅｖｅｌＤｅｃｉｓｉｏｎＭｅｔｈｏｄｆｏｒｔｈｅＭｕｌｔｉｏｂｊｅｃｔｉｖｅＰｒｏｂｌｅｍｗｉｔｈ０１ＶａｒｉａｂｌｅｓＳｈｅｎＨｏｕｃａｉ（沈厚才）ＺｈｏｎｇＷｅｉｊｕｎ（仲伟俊）ＸｕＮａｎｒｏｎｇ（徐南荣）（ＳｃｈｏｏｌｏｆＥｃｏｎｏ...     

最短路径及其求法

最优问题同图论中的最短路径问题等价 ,计算最短路径的较好算法是由 B.W.Dijkstra给出的标号法。以分步计算最后归纳为表格的方式叙述此算法     

星的细分图的IC-着色

研究了星的细分图的IC-着色问题,改进了星的细分图的IC-指数的下界,并且得到了两类图的IC-指数的一个下界。     

路的广义Mycielski图的全染色

设G是一个图,f是从V（G）∪E（G）到集合C的一个映射,如果f满足相邻点染色不同,相邻边染色不同,任意一个点与其关联的边染色不同,则称f是图G的全染色。针对此概念研究了路的广义Mycielski图的全染色。