Sorry, we do not have enough data to show an influence graph for this author.
Learn More
Two combinatorial methods for constructing a family of symmetric trivalent graphs are presented in this paper. Each family of graphs contains a member for every odd prime number p. It is proved that(More)
  • 1