Abstract
Lot of achievements have been done to comprehend the latest phenomena of our life by discussing the interrelationship of two boughs, graph theory and algebra, of mathematics. In the modern time, it seems to be of great importance to study about eminent, extensive and certifiable applications through well known tools of graph theory. Combinatorial commutative algebra, moderately new, quickly creating numerical tool and foremost tendril of mathematics, has been used exhaustively to solve a list of open problems in algebra under the shadow of graphs. It can be helpful, instead of algebraically, to find the metric dimension of zero-divisor graphs, NP-complete problem, related with finite mathematical structures. In this article we shall discuss some graphs, zero-divisor graphs of finite Boolean rings and balanced bipartite graphs of conjugacy closed loops, and their associated applications.
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 callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: 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.
