期刊文献+

图的Fractional边控制与Fractional边全控制 被引量:3

On Fractional Edge Total Domination of Graphs
下载PDF
导出
摘要 设G=(V,E)是一个图,一个函数f:E→[0,1]如果对所有的边e∈E(G),都有∑e∈N(e')f(e)≥1成立,则称f为图G的一个Fractional边全控制函数,简记为F边全控制函数,此处N(e')表示G中与边e'相关联的边集。图G的F边全控制数定义为γ'tf(G)=min{∑e∈E(G)f(e)f是G的一个F边全控制函数}.本文得到了一般图的F边全控制数的若干界限,还确定了一些特殊图的F边全控制数。 Let G=(V,E)be a graph,a functionf:E→ is said to be the fractional edge total dominating function(F edge total dominating function in brief) of Gif ∑e∈N(e′)f(e)≥1holds for every edge e∈E(G).The fractional edge total domination number of G is defined as γ′tf(G)=min{∑e∈E(G)f(e)│f is aFETDFof G.} In this paper,we give some bounds of the fractional edge total domination numbers of graphs,and determine the fractional edge domination numbers and fractional edge total domination numbers of some special graphs.
出处 《宜春学院学报》 2011年第8期7-8,共2页 Journal of Yichun University
基金 国家自然科学基金(10661007) 江西省教育厅科研项目(GJJ09215)
关键词 F边控制函数 F边控制数 F边全控制函数 F边全控制数 Fractional edge dominating function Fractional edge domination number Fractional edge total dominating function Fractional edge total domination number
  • 相关文献

参考文献7

  • 1S. M. HEDETNIEMI, S. T. HETNIEMI, T. V. WINER:Line- ar time resource allocation algorithms for trees. Technical report URI - 014, Department of Mathematics [ R ]. Clemson University, 1987.
  • 2S. MITCHELL, S. T. HEDETNIEMI: Edge domination in trees[ J]. Congr. Numer, 1977, (19) :489 -509.
  • 3Baogen Xu, On signed edge domination numbers of graphs [ J]. Discrete Math,2001,239( 1/2/3 ) : 179 - 189.
  • 4徐保根,周尚超.关于图的减边控制[J].江西师范大学学报(自然科学版),2007,31(1):21-24. 被引量:15
  • 5徐保根,李印权.关于图的符号边全控制数[J].数学的实践与认识,2009,39(5):138-144. 被引量:6
  • 6S. ARUMUGAM,Fractional edge domination in graphs. APPL ANAL Discete Math. 2009(3):359 -370.
  • 7HAYNES T W,HEDETNIEMI S T,SLATER P J. Domination in graphs [ M ]. New York : Marcel Dekker, INC, 1998.

二级参考文献19

  • 1Baogen Xu Shangchao Zhou.Characterization of connected graphs with maximum domination number[J].数学研究与评论,2000,:523-528.
  • 2Bondy J A, Murty V S R. Graph Theory with Applications[M]. Elsevier, Amsterdam,1976.
  • 3Cockayne E J, Mynhart C M. On a generalization of signed domination functions of graphs[J]. Ars Combin, 1996,43:235-245.
  • 4Haynes T W, Hedetniemi S T, Slater P J. Fundamentals of Domination in Graphs[M]. New York, 1998.
  • 5Haynes T W, Hedetniemi S T, Slater P J. Domination in Graphs[M]. New York,1998.
  • 6Baogen Xu. On signed edge domination numbers of graphs[J]. Discrete Math,2001,239:179-189.
  • 7Baogen Xu. On edge domination numbers of graphs[J]. Discrete Math,2005,294:311-316.
  • 8Baogen Xu. Two classes of edge domination in graphs[J]. Discrete Appl Math,2006,154:1541-1546.
  • 9Zhang Z, Baogen Xu, Li Y, Liu L. A note on the lower bounds of signed domination number of a graph[J]. Discrete Math, 1999,195:295-298.
  • 10Baogen Xu, Cockayne E J, Haynes T W, Hedetniemi S T, Zhou S. Extremal graphs for inequalities involving domination parameters [J]. Discrete Math, 2000,216 : 1-10.

共引文献18

同被引文献26

引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部