Abstract
AbstractA graph G is called invertible if its adjacency matrix A has an inverse which is the adjacency matrix of some graph H. All such graphs were shown by Harary and Minc to have the form nK2. We now introduce signed invertible (or briefly s‐invertible) graphs G as those whose inverse H is a signed graph. We identify two infinite classes of s‐invertible graphs: the paths P2n of even order, and the corona of any graph with K1. We then characterize s‐invertible trees.
Sign-in/Register to access full text options 
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.
