DOMINATION

作品数：127被引量：75H指数：4
导出分析报告
相关领域：理学更多>>
相关作者：孙良徐保根郭涛单而芳康丽英更多>>
相关机构：北京理工大学青海师范大学华东交通大学西安电子科技大学更多>>
相关期刊：更多>>
相关基金：国家自然科学基金国家教育部博士点基金国家重点基础研究发展计划上海市教育委员会重点学科基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 基金=国家重点基础研究发展计划x
共 条 记 录，以下是1-3
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Deviation Property of Periodic Measures in C^1 Non-uniformly Hyperbolic Systems with Limit Domination被引量：3
《Acta Mathematica Sinica,English Series》2012年第9期1727-1740,共14页Sheng QIAN Wen Xiang SUN Xue Ting TIAN 
supported by National Natural Science Foundation of China (Grant Nos. 10671006);supported by National Natural Science Foundation of China (Grant Nos. 10671006, 10831003);National Basic Research Program of China (973 Program, 2006CB805903);supported by CAPES (Brazil)
In a C1 non-uniformly hyperbolic systems with limit domination, we consider the periodic measures that supported on the Pesin set and keep a distance at least 6 to a hyperbolic ergodic measure μ given before. And the...
关键词：Exponential growth rate generalized entropy large deviation limit domination Pesin set 
A conjecture on k-factor-critical and 3-γ-critical graphs被引量：2
《Science China Mathematics》2010年第5期348-354,共7页WANG Tao1&YU QingLin2 1Institute of Applied Mathematics,College of Mathematics and Information Science,Henan University,Kaifeng 475001,China 2Department of Mathematics and Statistics,Thompson Rivers University,Kamloops,BC V2C5N3,Canada 
supported by Major State Basic Research Development Program of China (973 Project) (Grant No.2006CB805904);Natural Sciences and Engineering Research Council of Canada (Grant No.122059-200)
For a graph G =(V,E),a subset VS is a dominating set if every vertex in V is either in S or is adjacent to a vertex in S.The domination number γ(G) of G is the minimum order of a dominating set in G.A graph G is said...
关键词：DOMINATION CRITICAL GRAPH FACTOR CRITICAL bicritical 
Constructive characterizations of(γp,γ)-and(γp,γpr)-trees
《Applied Mathematics(A Journal of Chinese Universities)》2008年第4期475-480,共6页CHEN Lei LU Chang-hong ZENG Zhen-bing 
Supported in part by National Natural Science Foundation of China (60673048; 10471044);National Basic Research Program (2003CB318003);Shanghai Leading Academic Discipline Project (B407)
Let G = （V, E） be a graph without isolated vertices. A set S lohtain in V is a domination set of G if every vertex in V - S is adjacent to a vertex in S, that is N[S] = V. The domination number of G, denoted by γ（...
关键词：DOMINATION power domination PAIRED-DOMINATION TREE 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部