首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   6篇
  完全免费   1篇
  数学   7篇
  2016年   1篇
  2009年   1篇
  2008年   2篇
  2005年   1篇
  1996年   1篇
  1994年   1篇
排序方式: 共有7条查询结果,搜索用时 109 毫秒
1
1.
On adjacent-vertex-distinguishing total coloring of graphs   总被引:40,自引:0,他引:40  
In this paper, we present a new concept of the adjacent-vertex-distinguishing total coloring of graphs (briefly, AVDTC of graphs) and, meanwhile, have obtained the adjacent-vertex-distinguishing total chromatic number of some graphs such as cycle, complete graph, complete bipartite graph, fan, wheel and tree.  相似文献
2.
GLOBAL ATTRACTIVITY IN AGENERALIZED DELAY LOGISTIC EQUATION   总被引:7,自引:0,他引:7  
Abstract.Based on the literature  相似文献
3.
An interesting behavior of customers arriving to a queue for service concerns the manner in which they join the queue. The arrival discipline of the customers may be impolite, in the sense that an arriving customer who finds all servers busy may pick a position which is not necessarily at the end of the line. We introduce and discuss in detail such an arrival discipline of sufficient generality which has interesting applications. In particular, we show that the more impolite an arrival discipline is, the bigger is the variance of the waiting time. We also study a special model in more depth to provide simple computational formulas for several performance measures.  相似文献
4.
5.
In this paper a well known Duffing type equation is considered. By means of a Liapunov function and careful estimation, we establish a priori bounds for periodic solutions and their derived functions. Coincidence theorems can then be applied to yield sufficient conditions for the existence of periodic solutions. Our conclusion improve several well known results in the literature.  相似文献
6.
It is conjectured that χas(G) = χt(G) for every k-regular graph G with no C5 component (k 2). This conjecture is shown to be true for many classes of graphs, including: graphs of type 1; 2-regular, 3-regular and (|V (G)| - 2)-regular graphs; bipartite graphs; balanced complete multipartite graphs; k-cubes; and joins of two matchings or cycles.  相似文献
7.
令$\mathbb{N}$表示全体非负整数集, 集合$A\subseteq\mathbb{N}$. 令$W$是$\mathbb{N}$的非空子集. $\mathcal{F}^{\ast}(W)$表示$W$的全部有限非空的子集.固定整数$g\geq2$,令$A_{g}(W)$表示全部形如$\sum_{f\in F}a_{f}g^{f}$的数构成的集合, 其中$F\in \mathcal{F}^{\ast}(W)$ 且 $1\leq a_{f}\leq g-1$. 对于$i=0,1,2,3$, 令$W_{i}=\{n\in \mathbb{N} \mid n\equiv i \pmod 4\}$. 本文, 我们证明 $A=\bigcup_{i=0}^3 A_{g}(W_{i})$是一个$4$ 阶极小渐近基.  相似文献
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号