Abstract
A pendant vertex, x, of a finite graph, G, is ∗-fixed in case every automorphism of G − x fixes the unique vertex of G adjacent to x. It is proved that “almost all” finite graphs which have pendant vertices have ∗-fixed pendant vertices. In addition finite trees which have ∗-fixed pendant vertices are characterized.
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.
