Abstract
The Gallai graph Gal(G) of a graph G has the edges of G as its vertices, and two distinct vertices e and f of Gal(G) are adjacent in Gal(G) if the edges e and f of G are adjacent in G but do not span a triangle in G. In the present paper we characterize those graphs whose Gallai graphs are forests or trees, respectively.
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.
