Abstract
The power graph [Formula: see text] of a semigroup [Formula: see text] is a simple undirected graph whose vertex set is [Formula: see text] itself, and any two distinct vertices are adjacent if one of them is a power of the other. In this paper, we describe the power graph [Formula: see text] in terms of joins and disjoint unions of complete graphs, and use this to calculate the Laplacian polynomial of [Formula: see text]. We finally calculate the Laplacian polynomial of the power graph [Formula: see text].
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.
