|
|
|||
|
||||
OverviewHigh Quality Content by WIKIPEDIA articles! In the mathematical field of graph theory, a distance-transitive graph is a graph such that, given any two vertices v and w at any distance i, and any other two vertices x and y at the same distance, there is an automorphism of the graph that carries v to x and w to y. A distance transitive graph is vertex transitive and symmetric as well as distance regular. A distance-transitive graph is interesting partly because it has a large automorphism group. Some interesting finite groups are the automorphism groups of distance-transitive graphs, especially of those whose diameter is 2. Distance-transitive graphs were first defined in 1971 by Norman L. Biggs and D. H. Smith, who showed that there are only 12 finite trivalent distance-transitive graphs. Full Product DetailsAuthor: Toll Aaron PhilippePublisher: VDM Publishing House Imprint: VDM Publishing House Dimensions: Width: 22.90cm , Height: 0.40cm , Length: 15.20cm Weight: 0.125kg ISBN: 9786130932527ISBN 10: 6130932529 Pages: 76 Publication Date: 25 June 2010 Audience: General/trade , General Format: Paperback Publisher's Status: Active Availability: In Print This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |