Abstract
A graph $$\Gamma$$ is called homogenous if the group of automorphisms of $$\Gamma$$ acts transitively on the set of vertices of $$\Gamma$$ . We will study the following properties for homogenous graphs: Removability: a vertex p is removable if the graph obtained by removing it is isomorphic to the original. Property (R): for every edge x there exists an edge y such that removing x and y disconnects the graph. We will study also Cayley graphs of groups of automorphisms of graphs with the property (R) and related concepts.
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.
