418 KB31 KB200820252014Du, Shao FeiLi, XuewenWang, Lištevilka:1letnik:7str. 41-54COBISSID:16792665ISSN:1855-3966URN:URN:NBN:SI:doc-5RRNH3E0enDruštvo matematikov, fizikov in astronomov SlovenijeArs mathematica contemporaneagrupepermutation groupprimitive groupsemisymmetric graphteorija grafovvertex-transitive graphA class of semisymmetric graphs|A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not vertex-transitive. Every semisymmetric graph is a bipartite graph with two parts of equal size. Let ?$p$? be a prime. In this paper, a class of semisymmetric graphs of order ?$2p^3$? are determined. This work is a partial result for our long term goal to classify all semisymmetric graphs of order ?$2p^3$?TEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaUniverza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije