Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 85, 2008 - Issue 1
Submit an article Journal homepage
114
Views
10
CrossRef citations to date
0
Altmetric
Original Articles

Vulnerability parameters of split graphs

Yinkui Li Department of Mathematics, Qinghai Nationalities College, Xining, Qinghai, 810000, P.R. China
,
Shenggui Zhang Department of Applied Mathematics, Northwestern Polytechnical University, Xi'an, Shaanxi, 710072, P.R. ChinaCorrespondence[email protected]
&
Qilong Zhang Department of Applied Mathematics, Northwestern Polytechnical University, Xi'an, Shaanxi, 710072, P.R. China
Pages 19-23 | Received 12 Dec 2005, Accepted 22 Mar 2007, Published online: 31 Dec 2007

References

  • Chvátal , V. 1973 . Tough graphs and hamiltonian circuits . Discrete Mathematics , 5 : 215 – 228 .
  • Woeginger , G. J. 1998 . The toughness of split graphs . Discrete Mathematics , 190 : 295 – 297 .
  • Bondy , J. A. and Murty , U. S.R. 1976 . Graph Theory with Applications , London : Macmillan .
  • Jung , H. A. 1978 . On a class of posets and the corresponding comparability graphs . Journal of Combinatorial Theory Series B , 24 : 125 – 133 .
  • Kratsch , D. , Kloks , T. and Müller , H. 1994 . Computing the toughness and the scattering number for interval and other graphs . IRISA Report PI-806 ,
  • Zhang , S. , Li , X. and Han , X. 2002 . Computing the scattering number of graphs . International Journal of Computer Mathematics , 79 : 179 – 187 .
  • Grötschel , M. , Lovász , L. and Schrijver , A. 1988 . Geometric Algorithms and Combinatorial Optimization , Berlin : Springer .
  • Schrijver , A. 2000 . A combinatorial algorithms minimizing submodular functions in strongly polynomial time . Journal of Combinatorial Theory Series B , 80 : 346 – 355 .
  • Zhang , S. and Wang , Z. 2001 . Scattering number in graphs . Networks , 37 : 1 – 5 .
  • Barefoot , C. A. , Entringer , R. and Swart , H. 1987 . Vulnerability in graphs – a comparative survey . Journal of Combinatorial Mathematics and Combinatorial Computing , 1 : 13 – 21 .
  • Clark , L. H. , Entringer , R. C. and Fellows , M. R. 1987 . Computaional complexity of integrity . Journal of Combinatorial Mathematics and Combinatorial Computing , 2 : 179 – 191 .
  • Cozzen , M. , Moazzami , D. and Stueckle , S. 1995 . “ The tenacity of a graph ” . In Proceedings of the Seventh International Conference on the Theory and Applications of Graphs , 1111 – 1122 . New York : Wiley .
  • Li , Y. , Zhang , S. and Li , X. 2005 . Rupture degree of graphs . International Journal of Computer Mathematics , 82 : 793 – 803 .
  • Li , F. and Li , X. 2004 . Computing the rupture degrees of graphs . ISPAN , : 368 – 373 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.