A note on the problem of finding a (3,9)-cage
In this paper, we discuss The poblem of finding a (3,9)-cage. A hamiltonian graph with girth 9 and 54 vertices is given. Except four vertices, each of the remaining vertices of this graph has valency Three. This graph is obtained with the aid of a computer.
Saved in:
Main Author: | P. K. Wong |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
1985-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Subjects: | |
Online Access: | http://dx.doi.org/10.1155/S0161171285000916 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On certain regular graphs of girth 5
by: M. O'keefe, et al.
Published: (1984-01-01) -
CONDITIONS FOR GRAPHS ON n VERTICES WITH THE SUM OF DEGREES OF ANY TWO NONADJACENT VERTICES EQUAL TO n-2 TO BE A HAMILTONIAN GRAPH
by: Nhu An Do, et al.
Published: (2024-02-01) -
4-REGULAR GRAPH OF DIAMETER 2
by: Đỗ Như An, et al.
Published: (2013-06-01) -
Hamiltonian-connected graphs and their strong closures
by: Pak-Ken Wong
Published: (1997-01-01) -
THE STRUCTURE OF GRAPHS ON \(n\) VERTICES WITH THE DEGREE SUM OF ANY TWO NONADJACENT VERTICES EQUAL TO \(n-2\)
by: Do Nhu An
Published: (2021-10-01)