Enhanced maximization of even multiplicative labeling through subdivision graph
摘要
This study examines the subdivision of graphs in the context of multiplicative labeling. Subdivision involves inserting new vertices into edges and appropriately connecting them, altering the graph’s structure. We analyze how this transformation affects the maximization of even multiplicative labeling and explore its impact on the original graph. Additionally, we discuss applications in network analysis, communication networks and computational biology. Understanding the relationship between graph subdivision and multiplicative labeling enhances theoretical insights into graph structures and provides practical implications for solving real-world problems.