期刊文献+

关于圈C_n的IC-着色和IC-指数 被引量:4

IC-Colorings and IC-Indices of Cycles
在线阅读 下载PDF
导出
摘要 设正整数xi=f(vi)是图G的顶点vi的着色,H是G的子图,f(H)是H的顶点着色的和,若对任意正整数j(1jf(G))都存在G的连通子图H使得j=f(H),则称f是G的IC-着色。若f(G)最大,则称f(G)为G的IC-指数。考虑了圈Cn的IC-着色和IC-指数I;得到了:当n=10111214时Cn的IC-指数。 Providing a coloring f:V(G)→ N of graph G and any subgraph H of G we define f(H) = ∑f(v), v V(H).The coloring f is called an IC-coloring if for any integer j(1 ≤ j ≤ f(G)) there is a connected subgraph H of G to achieve f(H) = j;Also,we define the IC-index of G as M(G) = max f(G) and f is an IC-coloring of G.In this paper we examine Cn and determine their IC-indices for n = 10,11,12,14.
出处 《华东交通大学学报》 2012年第4期64-68,共5页 Journal of East China Jiaotong University
基金 国家自然科学基金项目(11061014) 江西省自然科学基金项目(20114BAB201027 2010GZS0031 20114BAB201025) 江西省教育厅科技项目(GJJ12307) 江西省科技支撑计划项目(20112BBE50026)
关键词 IC-着色 IC-指数 连通图 IC-coloring IC-index of a graph connected graph cycle
  • 相关文献

参考文献9

  • 1BONDY J A, MURTY U S R. Graph theory with applications [ M ]. Amsterdam: Elsevier Science Publishing Co. , Inc, 1976: 156-160.
  • 2SALEHI E, SIN-MIN LEE, KHATIRINEJAD M S./C-colorings and/C-indices of graphs[J]. Discrete Mathematics, 2005, 299(8):297-310.
  • 3GALLIAN J A. A survey: recent results, conjectures and open problems in labeling graphs [J]. Journal of Graph Theory, 1989,13(9):29-37.
  • 4徐保根.关于图的Grundy着色[J].华东交通大学学报,2010,27(1):78-81. 被引量:2
  • 5SHIUE C L, FU H L. The/C-indices of complete bipartite graphs [ J ]. The Electronic Journal of Combinatorics, 2008,15 (3) : 1-13.
  • 6PENRICE S G. Some new graph labeling problems: A preliminary report[J]. DIMACS Technical Reports, 1995,95 (7) : 1-9.
  • 7徐保根.图的控制理论[M].北京:科学出版社,2006:33-37.
  • 8徐保根,周尚超.图与补图的符号圈控制数[J].江西师范大学学报(自然科学版),2006,30(3):249-251. 被引量:9
  • 9徐保根,张亚琼,罗茜,丁宗鹏.图的反符号全控制数[J].华东交通大学学报,2012,29(1):35-38. 被引量:2

二级参考文献16

  • 1徐保根.图的符号圈控制[J].华东交通大学学报,2005,22(5):135-137. 被引量:4
  • 2BONDY J A, MURTY V S R. Graph Theory with Applications[ M ]. Amsterdam: Elsevier, 1976.
  • 3CHRISTEN C A, SELKOW S M. Some perfect coloring properties of graphs[J]. J. Combin. Theory Ser. B, 1979,27( 1 ):49-59.
  • 4ZAKER M. Results on the Grundy chromatic number of graphs[J]. Discrete Math. ,2006,306:3 166-3 173.
  • 5BONDY JA,MURTYV S R.Graph Theory withApplications[M].Amsterdam:Elsevier,1976:35-70.
  • 6DUNBAR J,AL ET.Signed domination in graphs,graphy theory,combinatorics and application[M].New York:Wiley,1995:311-322.
  • 7ZHANG ZHONGFU,XU BAOGEN.A note on the lower bounds of the signded domination number of a graph[J].Discrete Mathematices,1999,195:295-298.
  • 8BROERE I,HATTING J E,HENNING M A,MCRAC A A.Majority domination in graphs[J].Discrete Math,1995,138:125-135.
  • 9BONDAN Z.Signed total domination number of a graph[J].Czechoslovak Mathematical Joumal,2001,51(2):225-229.
  • 10KANG LIYING,SHEN ERFAN.Lower bounds on minus domination and k-subdomi-nation numbers[J].Theoretical Com-puter Science,2003,296:89-98.

共引文献11

同被引文献18

  • 1徐保根.关于连通图的IC-着色[J].华东交通大学学报,2006,23(1):134-136. 被引量:9
  • 2徐保根.图的控制理论[M].北京:科学出版社,2006:33-37.
  • 3SALEHI E, SIN MIN LEE, KHATIRINEJAD M S. IC-colorings and IC-indices of graphs [J]. Discrete Mathematics, 2005,299(8): 297-310.
  • 4ALTER R, BRNETY J A. A postage stamp problem [J]. The American Mathematical Monthly, 1980,87(3):206-210.
  • 5PENRICE S G. Some new graph labeling problems: A preliminary report [J]. DIMACS Technical Reports, 1995,95(7):1-9.
  • 6SHIUE C L, FU H L. The IC-indices of complete bipartite graphs[J]. The Electronic Journal of Combinatorics, 2008,15(3):1-13.
  • 7ALTER R, BERN31" J A. A postage stamp problem [J]. Amer Math Monthly,1980,87:206-210.
  • 8HEIMER R L, LANGNBACH H. The Stamp Problem [J]. J Recreational Math,1974,7:235-250.
  • 9LUNON W F. A Postage stamp problem [J]. Comput J,1969,12:377-380.
  • 10SALEHI E, LEE S, KHATIRINEjAD M. IC-colorings and IC-indices of graphs [J]. Discrete Mathematics, 2005, 299:297-310.

引证文献4

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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