CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
On weakly symmetric graphs of order twice a prime
Authors
Ying Cheng
James Oxley
Publication date
1 January 1987
Publisher
LSU Digital Commons
Doi
Cite
Abstract
A graph is weakly symmetric if its automorphism group is both vertex-transitive and edge-transitive. In 1971, Chao characterized all weakly symmetric graphs of prime order and showed that such graphs are also transitive on directed edges. In this paper we determine all weakly symmetric graphs of order twice a prime and show that these graphs too are directed-edge transitive. © 1987
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Elsevier - Publisher Connector
See this paper in CORE
Go to the repository landing page
Download from data provider
Last time updated on 06/05/2017
Louisiana State University
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:repository.lsu.edu:mathema...
Last time updated on 26/10/2023