首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   11篇
  国内免费   3篇
  完全免费   1篇
  数学   15篇
  2017年   1篇
  2016年   1篇
  2014年   1篇
  2013年   1篇
  2012年   2篇
  2011年   1篇
  2009年   1篇
  2008年   2篇
  2007年   1篇
  2006年   3篇
  2005年   1篇
排序方式: 共有15条查询结果,搜索用时 140 毫秒
1.
On adjacent-vertex-distinguishing total coloring of graphs   总被引:32,自引:0,他引:32  
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.
A Note on Adjacent Strong Edge Coloring of K(n,m)   总被引:11,自引:0,他引:11  
In this paper, we prove that the adjacent strong edge chromatic number of a graph K(n,m) is n + 1, with n ≥ 2, m ≥ 1.  相似文献
3.
若干联图的点可区别均匀边色数   总被引:5,自引:0,他引:5  
k-正常边染色法f,若满足任两个不同点的关联边色集不同,则称f为G的k-点可区别边染色,简记为k-VDEC of G,并称最小的k为G的点可区别边色数;对k-VDEC若再满足任意两色的边数之差不超过1,则称f为G的点可区别均匀边染色,简记为k-VDEEC of G,并称最小的k为G的点可区别均匀边色数.本文得到了图等阶的路和路,路和圈,圈和圈的联图的点可区别均匀边色数.  相似文献
4.
D(β)-vertex-distinguishing total coloring of graphs   总被引:2,自引:0,他引:2  
A new concept of the D(β)-vertex-distinguishing total coloring of graphs, i.e., the proper total coloring such that any two vertices whose distance is not larger thanβhave different color sets, where the color set of a vertex is the set composed of all colors of the vertex and the edges incident to it, is proposed in this paper. The D(2)-vertex-distinguishing total colorings of some special graphs are discussed, meanwhile, a conjecture and an open problem are presented.  相似文献
5.
D(β)-vertex-distinguishing total coloring of graphs   总被引:1,自引:0,他引:1  
A new concept of the D(β)-vertex-distinguishing total coloring of graphs, i.e., the proper total coloring such that any two vertices whose distance is not larger than β have different color sets, where the color set of a vertex is the set composed of all colors of the vertex and the edges incident to it, is proposed in this paper. The D(2)-vertex-distinguishing total colorings of some special graphs are discussed, meanwhile, a conjecture and an open problem are presented.  相似文献
6.
Suppose that \(G\) is a finite group and \(H\) , \(K\) are subgroups of \(G\) . We say that \(H\) is weakly closed in \(K\) with respect to \(G\) if, for any \(g \in G\) such that \(H^{g}\le K\) , we have \(H^{g}=H\) . In particular, when \(H\) is a subgroup of prime-power order and \(K\) is a Sylow subgroup containing it, \(H\) is simply said to be a weakly closed subgroup of \(G\) or weakly closed in \(G\) . In the paper, we investigate the structure of finite groups by means of weakly closed subgroups.  相似文献
7.
In this paper, an infinite horizon $H_2/H_\infty $ control problem is addressed for a broad class of discrete-time Markov jump systems with ( $x,u,v$ )-dependent noises. First of all, under the condition of exact detectability, the stochastic Popov–Belevich–Hautus (PBH) criterion is utilized to establish an extended Lyapunov theorem for a generalized Lyapunov equation. Further, a necessary and sufficient condition is presented for the existence of state-feedback $H_2/H_\infty $ optimal controller on the basis of two coupled matrix Riccati equations, which may be solved by a backward iterative algorithm. A numerical example with simulations is supplied to illustrate the proposed theoretical results.  相似文献
8.
本文对符合实际的具有状态脉冲效应的阶段结构的害虫防治模型进行研究,给出半连续动力系统、半连续动力系统的后继函数等的定义,根据动力系统的基本理论,采用脉冲微分方程几何理论的方法研究模型定义的半连续动力系统各种几何性质,得到系统存在阶1周期解的充分条件,阶1周期解全局轨道渐近稳定性的充分条件.获得的理论结果说明我们可以经过一次脉冲、两次脉冲、多次脉冲就能完全控制害虫使之不超过阖值.最后,我们用数值模拟的方法说明结果的正确性.  相似文献
9.
梅树立 《经济数学》2012,29(4):8-14
针对非线性Black-Scholes方程,基于quasi-Shannon小波函数给出了一种求解非线性偏微分方程的自适应多尺度小波精细积分法.该方法首先利用插值小波理论构造了用于逼近连续函数的多尺度小波插值算子,利用该算子可以将非线性Black-Scholes方程自适应离散为非线性常微分方程组;然后将用于求解常微分方程组的精细积分法和小波变换的动态过程相结合,并利用非线性处理技术(如同伦分析技术)可有效求解非线性Black-Scholes方程.数值结果表明了该方法在数值精度和计算效率方面的优越性.  相似文献
10.
针对个性化搜索中用户隐私保护的需求,提出一种面向隐私保护的个性化搜索结果排序方法.方法基于向量空间模型,引入安全点积计算方法来计算搜索相似度,旨在实现用户隐私保护的同时提高个性化搜索服务质量.首先分析了目前常用的搜索排序相似度计算方法存在的不足,然后分别介绍了向量空间模型和安全点积计算,最后详细介绍了面向隐私保护的个性化搜索结果排序方法,并对其性能进行了分析.  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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