Some semisymmetric graphs arising from finite vector spaces
2019 ◽
Vol 19
(11)
◽
pp. 2050216
Keyword(s):
A graph is worthy if no two vertices have the same neighborhood. In this paper, we characterize the automorphism groups of unworthy edge-transitive bipartite graphs, and present some worthy semisymmetric graphs arising from vector spaces over finite fields. We also determine the automorphism groups of these graphs.
1995 ◽
Vol 143
(1-3)
◽
pp. 87-97
◽
1984 ◽
Vol 37
(1)
◽
pp. 80-84
◽
1986 ◽
Vol 29
(1)
◽
pp. 79-83
◽
Keyword(s):
1998 ◽
Vol 179
(1-3)
◽
pp. 121-132
◽
2012 ◽
Vol 37
(2)
◽
pp. 361-380
◽
Keyword(s):
2011 ◽
Vol 34
(3)
◽
pp. 337-355
◽
2011 ◽
Vol 5
(2)
◽
pp. 407-416
◽
Keyword(s):