An Edge but not Vertex Transitive Cubic Graph*
1968 ◽
Vol 11
(4)
◽
pp. 533-535
◽
Keyword(s):
Let G be an undirected graph, without loops or multiple edges. An automorphism of G is a permutation of the vertices of G that preserves adjacency. G is vertex transitive if, given any two vertices of G, there is an automorphism of the graph that maps one to the other. Similarly, G is edge transitive if for any two edges (a, b) and (c, d) of G there exists an automorphism f of G such that {c, d} = {f(a), f(b)}. A graph is regular of degree d if each vertex belongs to exactly d edges.
1970 ◽
Vol 13
(2)
◽
pp. 231-237
◽
2008 ◽
Vol 77
(2)
◽
pp. 315-323
◽
Keyword(s):
1971 ◽
Vol 14
(2)
◽
pp. 221-224
◽
Keyword(s):
1967 ◽
Vol 19
◽
pp. 1319-1328
◽
Thinning a Triangulation of a Bayesian Network or Undirected Graph to Create a Minimal Triangulation
2017 ◽
Vol 25
(03)
◽
pp. 1750014
Keyword(s):
2008 ◽
Vol 85
(2)
◽
pp. 145-154
◽
1970 ◽
Vol 13
(4)
◽
pp. 451-461
◽