Abstract
AbstractWe present in this paper a discussion on some stability properties of line graphs. After relating the semi-stability properties of the line graph of a graph to a concept of Sheehan, we proceed to deduce that, with fully characterised lists of exceptions, the line graphs of trees and unicyclic graphs are semi-stable. We then discuss the problem of deciding which line graphs are stable. Via a discovery of the finite number of graphs G such that both G and its complement have stable line graphs, we show that P4 is the only self-complementary graph whose line graph is stable.
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.
