این سایت در حال حاضر پشتیبانی نمی شود و امکان دارد داده های نشریات بروز نباشند
Iranian Journal of Mathematical Sciences and Informatics، جلد ۱۸، شماره ۲، صفحات ۱۸۵-۱۹۸
عنوان فارسی
چکیده فارسی مقاله
کلیدواژه‌های فارسی مقاله
عنوان انگلیسی Embedding Wheel - like Networks
چکیده انگلیسی مقاله One of the important features of an interconnection network is its ability to efficiently simulate programs or parallel algorithms written for other architectures. Such a simulation problem can be mathematically formulated as a graph embedding problem. In this paper we compute the lower bound for dilation and congestion of embedding onto wheel-like networks. Further, we compute the exact dilation of embedding wheellike networks into hypertrees, proving that the lower bound obtained is sharp. Again, we compute the exact congestion of embedding windmill graphs into circulant graphs, proving that the lower bound obtained is sharp. Further, we compute the exact wirelength of embedding wheels and fans into 1,2-fault hamiltonian graphs. Using this we estimate the exact wirelength of embedding wheels and fans into circulant graphs, generalized Petersen graphs, augmented cubes, crossed cubes, Möbius cubes, twisted cubes, twisted n-cubes, locally twisted cubes, generalized twisted cubes, odd-dimensional cube connected cycle, hierarchical cubic networks, alternating group graphs, arrangement graphs, 3-regular planer hamiltonian graphs, star graphs, generalised matching networks, fully connected cubic networks, tori and 1-fault traceable graphs.
کلیدواژه‌های انگلیسی مقاله Embedding, Wheel, Friendship graph, Median, Hamiltonian.
نویسندگان مقاله | R. Sundara Rajan
Department of Mathematics, Hindustan Institute of Technology and Science, Chennai, India, 603 103


| T. M. Rajalaxmi
Department of Mathematics, Sri Sivasubramaniya Nadar College of Engineering, Chennai, India, 603 110


| Sudeep Stephen
Department of Mathematics, University of Auckland, New Zealand, 1010


| A. Arul Shantrinal
Department of Mathematics, Hindustan Institute of Technology and Science, Chennai, India, 603 103


| K. Jagadeesh Kumar
Department of Mathematics, Hindustan Institute of Technology and Science, Chennai, India, 603 103
نشانی اینترنتی http://ijmsi.ir/browse.php?a_code=A-10-4773-1&slc_lang=en&sid=1
فایل مقاله فایلی برای مقاله ذخیره نشده است
کد مقاله (doi)
زبان مقاله منتشر شده en
موضوعات مقاله منتشر شده عمومی
نوع مقاله منتشر شده پژوهشی
برگشت به: صفحه اول پایگاه   |   نسخه مرتبط   |   نشریه مرتبط   |   فهرست نشریات