Table of Contents
Journal of Discrete Mathematics
Volume 2013, Article ID 983830, 7 pages
http://dx.doi.org/10.1155/2013/983830
Research Article

On Connected m-HPK-Residual Graphs

College of Mathematics and Physics, Chongqing University of Posts and Telecommunications, Chongwen Road, Nan'an District, Chongqing 400065, China

Received 27 November 2012; Revised 20 January 2013; Accepted 22 January 2013

Academic Editor: Pantelimon Stǎnicǎ

Copyright © 2013 Huiming Duan and Yonghong Li. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. P. Erdös, F. Harary, and M. Klawe, “Residually complete graphs,” Annals of Discrete Mathematics, vol. 6, pp. 117–123, 1980. View at Publisher · View at Google Scholar · View at MathSciNet
  2. J. A. Bondy and U. S. R. Murty, Graph Theory, vol. 244 of Graduate Texts in Mathematics, Springer, New York, NY, USA, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  3. S. Yang, “The isomorphic factorization of complete tripartite graphs K(m,n,s)—a proof of F. Harary, R. W. Robinson and N. C. Wormald's conjecture,” Discrete Mathematics, vol. 145, no. 1–3, pp. 239–257, 1995. View at Publisher · View at Google Scholar · View at MathSciNet
  4. Y. Shibata, T. Hasunuma, and S. Fukuda, “Isomorphic factorization of de Bruijn digraphs,” Discrete Mathematics, vol. 218, no. 1–3, pp. 199–208, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. Z. Liang and H. Zuo, “On the gracefulness of the graph P2m,2n,” Applicable Analysis and Discrete Mathematics, vol. 4, no. 1, pp. 175–180, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  6. F. K. Hwang, “An isomorphic factorization of the complete graph,” Journal of Graph Theory, vol. 19, no. 3, pp. 333–337, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. J. Liao, S. Yang, and Y. deng, “On connected 2-Kn-residual graphs,” Mediterranean Journal of Mathematics, vol. 6, pp. 12–27, 2012. View at Google Scholar
  8. J. Liao, G. Long, and M. Li, “Erdös conjecture on connected residual graphs,” Journal of Computer, vol. 7, no. 6, pp. 1497–1502, 2012. View at Google Scholar
  9. J. Liao and M. Luo, “3-Kn-residual graphs,” Lecture Notes in Electrical Engineering LNEE, vol. 154, pp. 72–77, 2012. View at Google Scholar
  10. S. H. Yang and H. M. Duan, “Residually complete graphs with odd order,” Acta Mathematicae Applicatae Sinica, vol. 34, no. 5, pp. 778–785, 2011 (Chinese). View at Google Scholar · View at MathSciNet
  11. S. Yang and H. Duan, “Residually complete graph with weakly-minimum order,” Southwest China Normal University(Natural Science), vol. 6, pp. 7–14, 2006 (Chinese). View at Google Scholar
  12. S. H. Yang and X. W. Liu, “F[Kt]-residual graphs,” Xinan Shifan Daxue Xuebao Ziran Kexue Ban, vol. 28, no. 3, pp. 8–12, 2003 (Chinese). View at Google Scholar · View at MathSciNet
  13. S. H. Yang, “F3Kn×Ks-residual graphs,” Natural Science Journal of Qufu Teachers College, vol. 28, no. 3, pp. 34–38, 1985. View at Google Scholar · View at MathSciNet
  14. P. Luksic and T. Pisanski, “Distance-residual graphs,” Mathematics, vol. 9, pp. 104–111, 2006. View at Google Scholar
  15. B. Trotta, “Residual properties of simple graphs,” Bulletin of the Australian Mathematical Society, vol. 82, no. 3, pp. 488–504, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. A. A. Chernyak, “Residual reliability of P-threshold graphs,” Discrete Applied Mathematics, vol. 135, no. 1–3, pp. 83–95, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  17. R. Diestel, Graph Theory, vol. 173 of Graduate Texts in Mathematics, World Publishing Corporations, Beijing, China, 2nd edition, 2003. View at Publisher · View at Google Scholar · View at MathSciNet