Research Output | Dar Al-hikmah Library | IIUM Only
In this paper we will proof that every 3-connected K{1;3}B{2;5} (or K{1;3}B{3;4})-free graph is HamiltonianICMAE’12 2ND INTERNATIONAL CONFERENCE ON MATHEMATICAL APPLICATIONS IN ENGINEERING PROCEEDINGS F. A. M. Fauzee, M. R. A. Bakari, Aisha -Hassan A. Hashim, Othman O. Khalifa and J. I. Daoud , Malaysia ATTITUDE MANEUVERS OF A COMMUNICATION TECHN