一些特殊图类乘积的离散度(英文)Scattering Number of the Product of Some Special Classes of Graphs
阿依古丽.马木提;艾尔肯.吾买尔;边红;
摘要(Abstract)：
连通图的离散度是用s(G)来表示的,s(G)=max{ω(G-S)-|S|:ω(G-S)>1,SV(G)}.给出了两个完全图乘积的和一个完全图与路的乘积的离散度.还给出了两个完全图乘积的坚韧度.
关键词(KeyWords)： 离散度;坚韧度;图的乘积
基金项目(Foundation): The project sponsored by a research grant from Xinjiang university and Math.dept.
作者(Authors): 阿依古丽.马木提;艾尔肯.吾买尔;边红;
参考文献(References)：
- [1]Bondy J A,Murty U S R.Graph Theory with applications,Macmillan[M].New York:London and Elsevier,1976.
- [2]Hendry G R T.Scattering number and extremal non-hamiltonian graphs[J].Discrete Math,1998,71:165-175.
- [3]Jamrozik J,Kalinowski R,Skupien Z.A catalogue of small maximal nonhamiltonian graphs[J].Discrete Math,1982,39:229-234.
- [4]Giakoumakis G,Roussel F,Thuillier H.Scattering number and modulor decomposition[J].Discrete Math,1997,165/166:321-342.
- [5]Giakoumakis G,Roussel F,Thuillier H.On P4-tidy graphs[J].Discrete Math and Theoretical Computer Science,1997,(1):17-41.
- [6]Hoschta。ttler W,Tinhofer G.Hamiltonicity in graphs with few P4s[J].Rutcor Research Report,RRR,1997:16-93.
- [7]Ouyang K,Yu W.Relative breaktivity of graphs[J].J Lanzhou University(Natural Sciences),1993,29(3):43-49.
- [8]Zhang S,Wang Z.Scattering Number in graphs[J].Networks,2001,37:102-106.
- [9]Bauer D,Morgana A,Schmeichel E F.On the complexity of recognizing tough graphs[J].Discrete Math,1994,124:13-17.
- [10]Kratsch D,Kloks T,Müuller H.Measuring the vulnerability for classes of intersection graphs[J].DiscreteApplied Math,1997,77(3):259-270.
- [11]Zhang S Li X,Han X.Computing the scattering number of graphs[J].Int J Comput Math,2002,79:179-187.
- [12]Imrich W,Klaz∨zar S.ProductGraphs:Structure and Reconition[M].USA:Wiely,2000.