In this paper, we define and study the switching classes of directed graphs. The definition is a generalization of both Van Lint and Seidel's switching classes of graphs and Cameron's switching classes of tournaments. We actually do it in a general way so that Wells" signed switching classes of grap
Transitively equivalent directed graphs
โ Scribed by V. V. Martynyuk
- Book ID
- 105056721
- Publisher
- Springer US
- Year
- 1975
- Tongue
- English
- Weight
- 482 KB
- Volume
- 9
- Category
- Article
- ISSN
- 1573-8337
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In the present paper we find all the graphs on which a dihedral group acts edge-transitively. First we explicitly build the permissible permutation representations of the dihedral group. Then we use this knowledge to find all the graphs on which a dihedral group acts edge-transitively. These graph
We examine edge transitivity of directed graphs. The class of local comparability graphs is defined as the underlying graphs of locally edge transitive digraphs. The latter generalize edge transitive orientations, while local comparability graphs include comparability, anticomparability, and circle