AbstractWe say that a graph is Point-symmetric if, given any two points of the graph, there is an automorphism of the graph that sends the first point to the second. Similarly, we say that a graph is line-symmetric if, given any two lines of the graph, there is an automorphism that sends the first line to the second.In general a line-symmetric graph need not be point-symmetric. For example, any complete bipartite graph is line-symmetric, but if it is not regular then it is not point-symmetric. In this paper we investigate the extent to which line symmetry and regularity imply point symmetry.We first give some conditions on the number of points and the degree of regularity under which line symmetry and regularity imply point symmetry. We the...
AbstractA bipartite graph is said to be symmetric if it has symmetry of reflecting two vertex sets. ...
AbstractSpring algorithms are regarded as effective tools for visualizing undirected graphs. One maj...
Traditional textbooks usually discuss the point symmetries of functions only in relation to the orig...
AbstractWe say that a graph is Point-symmetric if, given any two points of the graph, there is an au...
This note resolves an open problem asked by Bezrukov in the open problem session of IWOCA 2014. It s...
This note resolves an open problem asked by Bezrukov in the open problem session of IWOCA 2014. It s...
This in-depth coverage of important areas of graph theory maintains a focus on symmetry properties o...
The history of graphs goes back to the work of Eulerin his discovery of the equation f – e + v = ...
AbstractIn this paper we deal with simple graphs. We investigate vertex-transitivity, edge-transitiv...
AbstractThis paper discusses point-symmetric graphs which have a prime number of points. Isomorphism...
An automorphism of a graph is a mapping of the vertices onto themselves such that connections betwee...
t1 t2 t3 t4 t5 t6 t7 t8 t9 t10 11 lit Amply regular graph We consider undirected graphs without loop...
AbstractA graph Γ is symmetric if its automorphism group acts transitively on the arcs of Γ, and s-r...
Abstract. A graph is symmetric, if its automorphism group is transitive on the set of its arcs. In t...
summary:A graph is said to be symmetric if its automorphism group acts transitively on its arcs. In ...
AbstractA bipartite graph is said to be symmetric if it has symmetry of reflecting two vertex sets. ...
AbstractSpring algorithms are regarded as effective tools for visualizing undirected graphs. One maj...
Traditional textbooks usually discuss the point symmetries of functions only in relation to the orig...
AbstractWe say that a graph is Point-symmetric if, given any two points of the graph, there is an au...
This note resolves an open problem asked by Bezrukov in the open problem session of IWOCA 2014. It s...
This note resolves an open problem asked by Bezrukov in the open problem session of IWOCA 2014. It s...
This in-depth coverage of important areas of graph theory maintains a focus on symmetry properties o...
The history of graphs goes back to the work of Eulerin his discovery of the equation f – e + v = ...
AbstractIn this paper we deal with simple graphs. We investigate vertex-transitivity, edge-transitiv...
AbstractThis paper discusses point-symmetric graphs which have a prime number of points. Isomorphism...
An automorphism of a graph is a mapping of the vertices onto themselves such that connections betwee...
t1 t2 t3 t4 t5 t6 t7 t8 t9 t10 11 lit Amply regular graph We consider undirected graphs without loop...
AbstractA graph Γ is symmetric if its automorphism group acts transitively on the arcs of Γ, and s-r...
Abstract. A graph is symmetric, if its automorphism group is transitive on the set of its arcs. In t...
summary:A graph is said to be symmetric if its automorphism group acts transitively on its arcs. In ...
AbstractA bipartite graph is said to be symmetric if it has symmetry of reflecting two vertex sets. ...
AbstractSpring algorithms are regarded as effective tools for visualizing undirected graphs. One maj...
Traditional textbooks usually discuss the point symmetries of functions only in relation to the orig...