{"version":"1.0","type":"link","title":"Symmetric graph - Newikis","description":"In the mathematical field of graph theory, a graph G is symmetric or arc-transitive if, given any two ordered pairs of adjacent vertices and of G, there is an automorphism","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/9/91/Petersen1_tiny.svg/1200px-Petersen1_tiny.svg.png","thumbnail_width":1200,"thumbnail_height":1200}