دانشگاه شهید مدنی آذربایجان

 آمار

تعداد نشریات6
تعداد شماره‌ها122
تعداد مقالات1,549
تعداد مشاهده مقاله1,640,742
تعداد دریافت فایل اصل مقاله1,538,440
Fahad, Asfand, Qureshi, Muhammad, Chaudhry, Muhammad, Irfan, Rida, Ashraf, Anas, Shang, Yilun. (1405). Irregularity-Based Entropy Inequalities Determining Complete Interconnection Network Complexity. , (), -. doi: 10.22049/cco.2026.31502.2870
Asfand Fahad; Muhammad Imran Qureshi; Muhammad Anwar Chaudhry; Rida Irfan; Anas Ashraf; Yilun Shang. "Irregularity-Based Entropy Inequalities Determining Complete Interconnection Network Complexity". , , , 1405, -. doi: 10.22049/cco.2026.31502.2870
Fahad, Asfand, Qureshi, Muhammad, Chaudhry, Muhammad, Irfan, Rida, Ashraf, Anas, Shang, Yilun. (1405). 'Irregularity-Based Entropy Inequalities Determining Complete Interconnection Network Complexity', , (), pp. -. doi: 10.22049/cco.2026.31502.2870
Fahad, Asfand, Qureshi, Muhammad, Chaudhry, Muhammad, Irfan, Rida, Ashraf, Anas, Shang, Yilun. Irregularity-Based Entropy Inequalities Determining Complete Interconnection Network Complexity. , 1405; (): -. doi: 10.22049/cco.2026.31502.2870

Irregularity-Based Entropy Inequalities Determining Complete Interconnection Network Complexity

Communications in Combinatorics and Optimization
مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 30 خرداد 1405
نوع مقاله: Original paper
شناسه دیجیتال (DOI): 10.22049/cco.2026.31502.2870
نویسندگان
Asfand Fahad1، 2؛ Muhammad Imran Qureshi3؛ Muhammad Anwar Chaudhry4؛ Rida Irfan5؛ Anas Ashraf3؛ Yilun Shang* 6
1School of Mathematical Sciences, Zhejiang Normal University, Jinhua 321004, China
2Center for Advanced Studies in Pure and Applied Mathematics, Bahauddin Zakariya University, Multan, Pakistan
3Department of Mathematics, COMSATS University Islamabad, Vehari Campus, Vehari, 61100, Pakistan
4Department of Mathematics and Statistics, Institute of Southern Punjab, Multan 60800, Pakistan
5Department of Mathematics, COMSATS University Islamabad, Sahiwal Campus, Sahiwal, 57000, Pakistan
6University of Northumbria
چکیده
In contemporary scientific research, network analysis theory contributes significantly to diverse systems, including forecasting cetane numbers, examining thermal transport phenomena, addressing sustainability in supply chains, monitoring postoperative health, shaping public policy through social networks, and investigating phase transitions in storage tanks. Various Interconnection networks (ICNs) are discriminated based on attributes such as bandwidth, latency, switch radix, and network topology. Entropy is pivotal in extracting meaningful information from these scientific models, thereby enhancing their efficiency. The butterfly and Benes networks and their derived networks are widely utilized in diverse systems, including IBM, NEC Cenju-3, MIT Transit Project, optical coupler internal structures, permutation routing, chip networks, and multiprocessor systems. To extract meaningful information, a few models to discriminate these networks on the basis of their entropy and complexity have been introduced in recent research. In this paper, we propose an entropy-determining model based on the irregularity of these ICNs, which is applied to obtain mathematical formulae for entropy determination, leading to complexity analysis of these ICNs. The analysis shows that we determine explicit inequalities through numeric data produced by these formulae, thus giving a complete characterization of this family of ICNs and answering the recently posed questions.
کلیدواژه‌ها
Irregularity-based Entropy؛ Complexity؛ Information functional؛ Network analysis؛ Interconnection networks
آمار
تعداد مشاهده مقاله: 1


سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب