Academic Journal

Exact vertex forwarding index of the Strong product of complete graph and cycle.

التفاصيل البيبلوغرافية
العنوان: Exact vertex forwarding index of the Strong product of complete graph and cycle.
المؤلفون: Qian, Weimin1 (AUTHOR) qwm5741@163.com, Li, Feng1 (AUTHOR) Li2006369@126.com
المصدر: Discrete Applied Mathematics. Jan2025, Vol. 361, p69-84. 16p.
مصطلحات موضوعية: *TELECOMMUNICATION systems, *COMPLETE graphs, *TOPOLOGICAL property, *NETWORK performance
مستخلص: Effectiveness represents a fundamental performance metric in network communication systems and is intricately tied to the routing made within the network. Since the vertex forwarding index is primarily employed to measure the load-bearing capacity of network nodes, it has become a crucial parameter for evaluating the quality of network routing. By investigating the topological parameters and properties of the Strong product network K k ⊗ C c and its factor networks (The undirected cycle networks C c with c ≥ 3 vertices and the complete networks K k with k ≥ 2 vertices), we have determined the exact vertex forwarding index of Strong product graph K k ⊗ C c , which depends solely on the number of vertices in the factor networks. [ABSTRACT FROM AUTHOR]
قاعدة البيانات: Academic Search Index
الوصف
تدمد:0166218X
DOI:10.1016/j.dam.2024.09.016