Abstract
The solubility graph associated with a finite group [Formula: see text] is a simple graph whose vertices are the elements of [Formula: see text], and there is an edge between two distinct elements [Formula: see text] and [Formula: see text] if and only if [Formula: see text] is a soluble subgroup of [Formula: see text]. We examine some properties of solubility graphs.
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.
