Edge properties of lexicographic product graphs of open neighborhood graphs

Abstract

This research investigates the complex edge characteristics of lexicographic product graphs formed from open neighborhood graphs, filling a notable gap in understanding their structural and adjacency features. Such graphs are pivotal in combinatorial optimization, network architecture, and computational graph theory, particularly for analyzing large-scale systems. By employing rigorous mathematical formulations, the study calculates vertex degrees, edge counts, and degree regularity across diverse graph classes, including cycles, complete graphs, and bipartite structures. A key discovery is the non-commutative nature of the lexicographic product of a graph with its open neighborhood graph, which challenges conventional understandings of graph interactions. MATLAB implementations augment this analysis, providing empirical validation and bridging the gap between theoretical insights and computational applications.
The findings underscore the precision with which edge properties and adjacency relationships can be characterized, offering a harmonious integration of abstract theory with real-world applicability. This research enriches the comprehension of graph dynamics, catering to the needs of scholars and practitioners in computer science, telecommunications, and data analytics. By laying a robust groundwork for future inquiries into graph optimization and network analysis, the study establishes itself as a cornerstone in discrete mathematics. It also highlights the transformative potential of computational tools in elucidating complex network structures.