Abstract
I(G) = G. This paper solves this problem for finite connected graphs with loops and parallel edges, extending earlier work on the problem. A loop (an edge whose two ends coincide in a single vertex) is considered adjacent to itself, and hence generates another loop under the / mapping. If two edges of G connect the same two vertices, the corresponding vertices of I(G) are also connected by two distinct edges.
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.
