Skip to search formSkip to main contentSkip to account menu

Symmetric graph

Known as: Arc-transitive graph, Flag-transitive graph, Foster Census 
In the mathematical field of graph theory, a graph G is symmetric (or arc-transitive) if, given any two pairs of adjacent vertices u1—v1 and u2—v2 of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

21 relations

Broader (1)

Algebraic graph theory
Bipartite double coverConnectivity (graph theory)Distance-transitive graphDodecahedron

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
On 3-arc-transitive covers of the dodecahedron graph
In this paper, the following problem is considered: does there exist a t - arc-transitive regular covering graph of an s -arc… 
2015
2015
On Edge-Transitive Graphs of Square-Free Order
We study the class of  edge-transitive graphs of square-free order and valency at most $k$. It is shown that, except for a few… 
2015
2015
Symmetrization of generalized natural residual function for NCP
2014
2014
Generalized edge-magic total labellings of models from researching networks
2013
2013
A note on the degree-diameter problem for arc-transitive graphs
We give two lower bounds on the largest order of an arc-transitive graph of diameter two and a given degree. 
2010
2010
Vertex-transitive expansions of (1, 3)-trees
2007
2007
An infinite family of sharply two-arc transitive digraphs
Highly Cited
2006
Highly Cited
2006
On the controlled agreement problem
Our work examines the controlled agreement problem over a network of interconnected dynamic units. The agreement protocol has… 
Review
1998
Review
1998
Scalable and Multilevel Iterative Methods
OF THE DISSERTATION Scalable and Multilevel Iterative Methods by Wing Lok Wan Doctor of Philosophy in Mathematics University of… 
1979
1979
MAGNITUDE ORDERING OF DEGREE COMPLEMENTS OF CERTAIN NODE PAIRS IN AN UNDIRECTED GRAPH AND AN ALGORITHM TO FIND A CLASS OF MAXIMAL SUBGRAPHS
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)