Abstract
Many real‐world applications can be modelled as graphs or networks, including social networks and biological networks. The theory of algebraic combinatorics provides tools to analyze the functioning of these networks, and it also contributes to the understanding of complex systems and their dynamics. Algebraic methods help uncover hidden patterns and properties that may not be immediately apparent in a visual representation of a graph. In this paper, we introduce left and right inverse graphs associated with finite loop structures and two mappings, P‐edge labeling and V‐edge labeling, of Latin squares. Moreover, this work includes some structural and graphical results of the commutator subloop, nucleus, and loop isotopes of inverse property quasigroups.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
