云南高校图书馆联盟文献共享服务平台- 国家自然科学基金(10571117)

国家自然科学基金(10571117): 作品数：10被引量：7H指数：2; 导出分析报告; 相关作者：单而芳郑大昭康丽英高瑞平梁作松更多>>; 相关机构：上海大学香港理工大学河北科技师范学院湛江师范学院更多>>; 相关期刊：《上海大学学报（自然科学版）》《Acta Mathematica Sinica,English Series》更多>>; 相关主题：GRAPHSSIGNEDDOMINATIONGRAPHBOUND更多>>; 相关领域：理学电气工程自动化与计算机技术电子电信更多>>

Minus total k-subdomination in graphs: 《Journal of Shanghai University(English Edition)》2009年第5期417-422,共6页段铸荣单而芳李明松吴卫国; supported by the National Natural Science Foundation of China (Grant No.10571117);the Development Foundation of Shanghai Municipal Education Commission (Grant No.05AZ04); Let G = (V,E) be a simple graph without isolated vertices. For positive integer k, a 3-valued function f : V → {-1,0,1} is said to be a minus total k-subdominating function (MTkSF) if sum from (u∈N(v)) to f(u)≥1 fo...; 关键词：minus total k-subdomination PATH complete graph complete bipartite graph BOUND

Domination Number in Graphs with Minimum Degree Two: 《Acta Mathematica Sinica,English Series》2009年第8期1253-1268,共16页Er Fang SHAN Moo Young SOHN Xu Dong YUAN Michael A. HENNING; supported by Korea Research Foundation Grant (KRF-2002-015-cp0050);the National Natural Science Foundation of China (Grant Nos. 60773078, 10571117);the ShuGuang Plan of Shanghai Education Development Foundation (Grant No. 06SG42);M. A. Henning is supported in part by the South African National Research Foundation;the University of KwaZulu-Natal;supported by Shanghai Leading Academic Discipline Project (No. $30104); A set D of vertices of a graph G = （V, E） is called a dominating set if every vertex of V not in D is adjacent to a vertex of D. In 1996, Reed proved that every graph of order n with minimum degree at least 3 has a ...; 关键词：GRAPH dominating set domination number restricted domination number

一类团横贯数等于团独立数的图: 《湛江师范学院学报》2009年第3期11-12,15,共3页梁作松单而芳; 国家自然科学基金资助项目(10571117);上海市曙光计划资助项目(06SG42); 把图G的每一个团看作一个点,两点之间有边相连当且仅当它们对应的团有非空交(即有公共点),这样得到的图称为图G的团图,记为K(G).文章证明了如果一个图对应的团图为二部图,则该图的团横贯数等于团独立数,即cτ(G)=cα(G),另外给出了判断...; 关键词：团团横贯数团独立数团图算法

图的全符号局部控制数: 《上海大学学报（自然科学版）》2009年第3期272-275,共4页段铸荣高明晶高瑞平; 考虑图G=(V,E)均为不含有孤立点的有限简单连通图.f是一个从V∪E→{-1,1}的函数,记f的权为ω(f)=∑x∈V∪Ef(x),对V∪E中任一元素x,定义f[x]=∑y∈NT(x)f(y),NT(x)表示与x关联边、相邻点的集合.图G的全符号局部控制函数为f:V∪E→{-1,1}...; 关键词：完全二部图圈全符号局部控制数下界上界

Clique-transversal number of graphs whose clique-graphs are trees: 《Journal of Shanghai University(English Edition)》2008年第3期197-199,共3页梁作松单而芳; Project supported by the National Natural Science Foundation of China （Grant No.10571117）, and the Development Foundation of Shanghai Municipal Commission of Education （Grant No.05AZ04）; Given a graph G, a subgraph C is called a clique of G if C is a complete subgraph of G maximal under inclusion and ｜C｜ ≥2. A clique-transversal set S of G is a set of vertices of G such that S meets all cliques of ...; 关键词：clique-transversal number clique-graph tree BOUND

正则图的团横贯数的界被引量：1: 《中国科学（A辑）》2007年第11期1257-1268,共12页单而芳郑大昭康丽英; 国家自然科学基金(批准号:10571117;60773078);香港理工大学博士后基金(批准号:G-YX69);上海市曙光计划(批准号:06SG42)资助项目; 设D是图G的一个顶点子集,若D含有G的每个团中至少一个顶点,则D称为G的团横贯集.图G的团横贯数是指它的最小团横贯集中顶点的数目,记作T_c(G).本文研究正则图的团横贯数.首先建立了正则图的团横贯数的上、下界,且刻画了达到下界的极值图...; 关键词：图正则图无爪三次图团横贯集团横贯数

Dominating functions with integer values in graphs a survey被引量：2: 《Journal of Shanghai University(English Edition)》2007年第5期437-448,共12页康丽英单而芳; Project supported by the National Natural Science Foundation of China （Grant No.10571117）, the Shuguang Plan of Shang- hai Education Devel0pment Foundation （Grant No.06SG42）, and the Natural Science Development Foundation of Shanghai Municipal Commission of Education （Grant No.05AZ04）; For an arbitrary subset P of the reals, a function f ： V →P is defined to be a P-dominating function of a graph G = （V, E） if the sum of its function values over any closed neighbourhood is at least 1. That is, fo...; 关键词：P-dominating function signed domination signed total domination minus domination minus total domination.

Power domination in planar graphs with small diameter被引量：1: 《Journal of Shanghai University(English Edition)》2007年第3期218-222,共5页赵敏康丽英; Project supporte（t by the National Natural Science Foundation of China （Grant No.10571117）, and the Youth Science Foundation of Shanghai Municipal Commission of Education （Grant No.01QN6262）; The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well-known vertex covering and dominating set problems in graph theory. In t...; 关键词：GRAPH power domination planar graph outerplanar graph

(k,l)-kernels in line digraphs被引量：1: 《Journal of Shanghai University(English Edition)》2006年第6期484-486,共3页鲁勤单而芳赵敏; Project supported by National Natural Science Foundation ofChina(Grant No .10571117); Let D = （ V, A ） be a digraph with minimum indegree at least one and girth at least k, where k ≥ 2 is an integer. In this paper, the following results were proved. A digraph D has a （ k, l ）-kernel if and only ff...; 关键词：KERNEL k-kernel （k l）-kernel

Signed total domination in nearly regular graphs被引量：2: 《Journal of Shanghai University(English Edition)》2006年第1期4-8,共5页康丽英单而芳; ProjectsupportedbyNationalNaturalScienceFoundationofChina(GrantNo.10571117),andDevelopingScienceFoundationofShanghaiEducationCommittee(GrantNo.05AZ04); A function f： V（ G）→{1,1} defined on the vertices of a graph G is a signed total dominating function （STDF） if the sum of its function values over any open neighborhood is at least one. An STDF f is minimal if t...; 关键词：signed total domination nearly regular graph bounds.

国家自然科学基金(10571117)