| 关于图的负k-子确定数的上界 |
| |
| 引用本文： | 乔丽娜,陈学刚.关于图的负k-子确定数的上界[J].华东交通大学学报,2011,28(2):41-44. |
| |
| 作者姓名： | 乔丽娜 陈学刚 |
| |
| 作者单位： | 华北电力大学数理学院,北京,102206 |
| |
| 基金项目： | 国家自然科学基金项目，中央高校基础科研基金 |
| |
| 摘 要： | 设G=(V,E)为一个n阶无向简单图,N(v)={u∈V|uv∈E},k为一个整数(1≤k≤n).若函数fV→{-1,1}满足条件:V中至少有k个顶点v,使得f(N(v))≤1成立,则称f为图G的一个负k-子确定函数.称βkD(G)=max{f(V)|f为图G的负k-子确定函数}为图G的负k-子确定数.文中主要给出了图...
|
| 关 键 词： | 图 负k-子确定函数 负k-子确定数 |
Upper Bounds on the Negative k-Subdeeision Number of Graphs |
| |
| Qiao Lina,Chen Xuegang.Upper Bounds on the Negative k-Subdeeision Number of Graphs[J].Journal of East China Jiaotong University,2011,28(2):41-44. |
| |
| Authors: | Qiao Lina Chen Xuegang |
| |
| Institution: | (Department of Mathematics and Physics,North China Electric Power University,Beijing 102206,China) |
| |
| Abstract: | Let G =（V,E） be a simple undirected graph with order n,N（v） ={u∈V｜uv ∈E},k is an integer（1≤k≤n）.If a function f：V←{-1,1} satisfies f（N（v）） ≤1 for at least k vertices v of G,then we called fis a negative k-subdecision function of G.βkD（G） =max{f（V）｜ fis a negative k-subdecision function of G} is called negative k-subdecision number of G.This paper mainly give several upper bounds of negative k-sub-decision numbera,nd some results of ghameshlou in 8] are improved. |
| |
| Keywords: | graphs negative k-subdecision function negative k-subdecision number |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
