Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 89, 2012 - Issue 6
Submit an article Journal homepage
104
Views
2
CrossRef citations to date
0
Altmetric
Section A

Inverse degree and super edge-connectivity

Yingzhi Tian College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang, 830046, P.R. ChinaCorrespondence[email protected]
,
Litao Guo College of Science, Henan University of Technology, Zhengzhou, Henan, 450052, P.R. China
,
Jixiang Meng College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang, 830046, P.R. China
&
Chengfu Qin School of Mathematics Science, Guangxi Teachers Education University, Guangxi, Nanning, 530001, P.R. China
Pages 752-759 | Received 03 May 2011, Accepted 27 Jan 2012, Published online: 27 Feb 2012

References

  • Balbuena , C. , Carmona , A. , Fabrega , J. and Fiol , M. A. 1999 . Superconnectivity of bipartite digraphs and graphs . Discrete Math , 197/198 : 61 – 75 .
  • Bauer , D. , Boesch , F. T. , Suffel , C. and Tindell , R. 1981 . “ Connectivity extremal problems and the design of reliable probabilistic networks ” . In The Theory and Application of Graphs , Edited by: Chartrand , G. , Alavi , Y. , Goldsmith , D. , Lesniak Foster , L. and Lick , D. 45 – 54 . New York : Wiley .
  • Boesch , F. 1986 . On unreliability polynomials and graph connectivity in reliable network synthesis . J. Graph Theory , 10 : 339 – 352 .
  • Bondy , J. A. and Murty , U. S.R. 1976 . Graph Theory with Applications , London : Macmillan .
  • Chartrand , G. 1966 . A graph-theoretic approach to a communications problem . SIAM J. Appl. Math , 14 : 778 – 781 .
  • Dankelmann , P. and Volkmann , L. 1995 . New sufficient conditions for equality of minimum degree and edge-connectivity . Ars Combin , 40 : 270 – 278 .
  • Dankelmann , P. , Hellwig , A. and Volkmann , L. 2009 . Inverse degree and edge-connectivity . Discrete Math , 309 : 2943 – 2947 .
  • Fiol , M. A. 1992 . On super-edge-connected digraphs and bipartite digraphs . J. Graph Theory , 16 : 545 – 555 .
  • Hellwig , A. and Volkmann , L. 2008 . Maximally edge-connected and vertex-connected graphs and digraphs: A survey . Discrete Math , 308 : 3265 – 3296 .
  • Kelmans , A. K. 1972 . Asymptotic formulas for the probability of k-connectedness of random graphs . Theory Probab. Appl , 17 : 243 – 254 .
  • Lesniak , L. 1974 . Results on the edge-connectivity of graphs . Discrete Math , 8 : 351 – 354 .
  • Plesník , J. 1975 . Critical graphs of given diameter . Acta Fac. Rerum Nat. Univ. Commen. Math , 30 : 71 – 93 .
  • Soneoka , T. 1992 . Super edge-connectivity of dense digraphs and graphs . Discrete Appl. Math , 37/38 : 511 – 523 .

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.