A new approach to catalog small graphs of high even girth
Abstract
A catalog of a class of graphs for even girth is introduced in this paper. A graph is a regular graph with degree and girth . This catalog of graphs for even girth satisfying , has the following properties. Firstly, this catalog contains the smallest known graphs. An appropriate class of cubic graphs for this catalog has been identified, such that the graph of minimum order within the class is also the smallest known graph. Secondly, this catalog contains graphs for more orders than other listings.
Thirdly, the class of graphs have been defined so that a practical algorithm to generate graphs can be created. Fourthly, this catalog is infinite, since the results are extended into knowledge about infinitely many graphs.
The findings are as follows. Firstly, Hamiltonian bipartite graphs have been identified as a promising class of cubic graphs that can lead to a catalog of graphs for even girth with graphs for more orders than other listings, that is also expected to contain a graph with minimum order. Secondly, this catalog of graphs contains many nonvertextransitive graphs. Thirdly, in order to make the computation more tractable, and at the same time, to enable deeper analysis on the results, symmetry factor has been introduced as a measure of the extent of rotational symmetry along the identified Hamiltonian cycle. The D3 chord index notation is introduced as a concise notation for cubic Hamiltonian bipartite graphs. The D3 chord index notation is twice as compact as the LCF notation, which is known as a concise notation for cubic Hamiltonian graphs. The D3 chord index notation can specify an infinite family of graphs.
Fourthly, results on the minimum order for existence of a Hamiltonian bipartite graph, and minimum value of symmetry factor for existence of a Hamiltonian bipartite graph are of wider interest from an extremal graph theory perspective.
Keywords: catalog, Hamiltonian bipartite, rotational symmetry, nonexistence
1 Introduction
A graph is a regular graph with degree and girth . Cubic graphs are regular graphs with degree . Only graphs that are undirected and simple are considered in this paper.
Tutte 1947 [54] posed the cage problem as a problem in extremal graph theory, which refers to finding the smallest graph, which is referred to as the cage. The order of a case is referred to as . This problem has been solved for a limited range of degree and specified girth . The cage is currently known only for .
The difficulty in finding the smallest graph in general is illustrated in the following historical example. The vertextransitive
A catalog of graphs for even girth has been listed by the present author in [48]. This catalog of Hamiltonian bipartite graphs (HBGs) has graphs for the range of girth satisfying . The detailed comparison of this catalog with other lists and the infiniteness of this catalog is discussed in [49]. A discussion on graphs and the partial likelihood of the record graph found by Exoo being a cage has been provided in [50].
The goals for this research are listed in this section, the related works for this research are discussed in section 2 and some important observations are made in subsection 2.8, which motivate the catalog in section 3. The consequent findings arising from this work are listed in section 4, and limitations and open problems in section 5.
1.1 Context of this catalog
The enumeration of cubic symmetric
A more detailed literature review of catalogs or lists of graphs is provided in section 2, that points out that the enumeration of all nonisomorphic cubic graphs for orders greater than 32 is currently open.
The goal of this research is to create a new catalog of graphs with graphs for many more orders than other known lists, with properties as follows.

Goal 1: This catalog should contain the smallest known graphs. As the class of vertextransitive graphs does not attain this, this catalog should cover a class of graphs wider than vertextransitive graphs. One task is to identify an appropriate class of graphs for this catalog, such that the graph of minimum order within the class is also the smallest known graph.

Goal 2: This catalog should contain graphs with larger number of orders and larger girths than the existing listings, with graphs outside the vertextransitive class for many orders. This will not be attained if all nonisomorphic graphs are enumerated. To overcome this hurdle, subclasses are defined, and list one representative from each subclass (if the subclass is not empty).

Goal 3: The class of graphs for goal 1 and subclasses for goal 2 should be defined so that a practical algorithm to generate graphs can be created. This is challenging because of the difficulty of generating graphs of large girths.

Goal 4: The resulting graph catalog should be analyzed. As computational approach is obviously limited in that it can create finite number of results, an analysis should be developed that extends the results into knowledge about infinitely many graphs and knowledge in extremal graph theory perspective.
1.2 About Hamiltonicity and bipartiteness
The choice of class of cubic graphs for this catalog [48] is Hamiltonian bipartite. This is discussed further in section 3. Some of the background behind making this choice is explained in this subsection.
The Lovasz conjecture 1969 [38] states, “Every finite connected vertextransitive graph contains a Hamiltonian path”. A variant of this conjecture is as follows, “Every finite connected vertextransitive graph contains a Hamiltonian cycle, with the exception of the five known counterexamples.” This conjecture is currently unsettled. All known vertextransitive graphs are Hamiltonian, with the exception of the five counterexamples which are the Petersen graph, complete graph of order 2, , the Coxeter graph, and two graphs derived from the Petersen graph and Coxeter graph by replacing each vertex with a triangle.
A recent study on nonHamiltonian regular graphs of arbitrary girth by Haythorpe [42] shows that the smallest known nonHamiltonian regular graphs of girth are larger than the corresponding cages until .
The smallest order for a nonHamiltonian graph from Haythorpe [42] is found to be 30, and the cage has order 14.
Hence, it does appear that Hamiltonicity might be an important requirement for finding small graphs of large girth.
It is also well known that all the currently known cages for even girth are Hamiltonian. Open problem 4 is raised in Section 5 about whether every cage, other than the known exception of the cage, the Petersen graph, has a Hamiltonian cycle.
All the currently known cages for even girth are bipartite. An still open problem raised by Harary 1970s, and Wong 1982 [37], “Is every cage of even girth bipartite?”
When one considers the smallest nonbipartite vertextransitive graph for even girth in Table 1, and when one compares it with Table 3, it is clear that the empirical data suggests that the order of the smallest nonbipartite vertextranstive graph of even girth is much greater than the smallest vertextranstive graph of even girth.
Hence, Hamiltonian bipartite could be a very promising class of cubic graphs for the catalog of graphs of large even girth.
1.3 About symmetry
It is well known that most graphs are asymmetric, that is, have no nontrivial automorphisms. The various kinds of graph symmetry defined in the literature have been based on the properties of the automorphism group of the graph, and some of them are defined in this subsection.
Definition 1.
Vertextransitive Lauri J. et al. [33]
“We say that a graph is vertextransitive if any two vertices of are similar, that is, if, for any , there is an automorphism of such that .”
Definition 2.
Edgetransitive Lauri J. et al. [33]
“A graph is edgetransitive if, given any two edges and , there exists an automorphism such that , that is, .”
Definition 3.
Semisymmetric
An edgetransitive graph that is also regular but not vertextransitive is said to be semisymmetric.
The smallest semisymmetric graph is known to be the Gray graph of order 54, which is known to be cubic, Hamiltonian, and bipartite.
Definition 4.
Symmetric graph
A graph is said to be symmetric if it is both vertextransitive as well as edgetransitive.
Definition 5.
Arctransitive Lauri J. et al. [33]
“If has the property that, for any two edges , there is an automorphism such that and and also an automorphism such that and , then is said to be arctransitive.”
Definition 6.
Distancetransitive Lauri J. et al. [33]
“A graph is said to be distancetransitive if given any vertices such that , there is an automorphism of such that and .”
Many of the known cages have a high level of symmetry. The cage, the Heawood graph is known to be bipartite, Hamiltonian, distancetransitive, vertextransitive, edgetransitive and hence symmetric. The cage, the TutteCoxeter graph is known to be bipartite, Hamiltonian, distanceregular, distancetransitive, vertextransitive, edgetransitive and hence symmetric. The cage, the Tutte12 cage or Benson graph is known to be bipartite, Hamiltonian, edgetransitive but not vertextransitive and hence semisymmetric.
The LCF notation was introduced by Lederberg [34] and by Frucht [46]. The LCF notation is general in the sense that it can represent any arbitrary cubic Hamiltonian graph.
An interesting result from Rodriquez [39] is the following, “ A cubic graph is Hamiltonian if and only if it has a representation in LCF notation.”
The D3 chord index notation has been introduced in Definition 7 in Section 3, has been motivated by circulant graphs and the LCF notation, but is meant to represent cubic Hamiltonian bipartite graphs in a more compact manner than the LCF notation. Symmetry factor as a measure of rotational symmetry as per chosen Hamiltonian cycle has been introduced in Definition 8 in Section 3, and is similar to the exponent in the LCF notation. Similar to the LCF notation, the D3 chord index notation becomes more compact for cubic Hamiltonian bipartite with rotational symmetry.
2 Related Works
The focus of this section is a review of the literature on tables and catalogs of graphs.
Various researchers have commented on the importance of tables of graphs. Quoting from Read 1981 [9]: “In this paper I shall give some information on recent advances in the generation of catalogues of graphs; but first it might be as well as to say a little about why one would want to generate such catalogues at all – why, for example, one would wish to produce all the graphs on 8 vertices.
There are many uses to which such a list could be put. Scrutiny of the list by hand or by computer, may suggest conjectures, or settle some question by turning up a counterexample. It may also enable one to get general ideas about graphs and their properties. Sometimes a list of graphs will supply numerical information for enumerative problems where a theoretical solution is absent, or provide a source of specimen graphs can be taken for use in one of the reallife problems to which graph theory can be applied”.
Faradzhev 1976 in [1], said that graph theory was in a botonical stage of development and a “herbarium” of graphs was a useful thing to have around.
A recent paper by Brinkmann et al. 2012 [21] states, “Such lists can serve as a source for intuition when one studies some conjecture and even as a possible source for counterexamples.”
The important survey papers found in the area of graph generation are Read 1981 [9] which focusses on simple graphs and Brinkmann et al. 2013 [20] which focusses on cubic graphs.
2.1 Research on enumeration of simple graphs
An important research on counting of simple graphs is described in this subsection. The number of simple graphs for relatively small orders is known to be large. Harary et al. 1973 [17] provide an asymptotic formula for number of simple graphs for a specified order. Read 1981 [9] lists early developments for listing graphs. Kagno 1946 [29] enumerated and showed that the number of simple graphs with order is . Heap B.R. 1972 [28] enumerated and showed that the number of simple graphs with order is . Baker, Dewdney et al. 1974 [27] enumerated and showed that the number of simple graphs with order is . The number of simple graphs with order is mentioned as by Harary et al. 1973 [17]. The number of connected graphs with order is given as in Brinkmann et al. [21] 2013. The number for simple graphs for order 24 is 195704906302078447922174862416726256004122075267063365754368 as per Keith M. Briggs, Combinatorial Graph Theory http://keithbriggs.info/cgt.html.
2.2 Research on enumerating cubic graphs
Up to order  Author  Year  Reference 

10  Vries  1889, 1891  [30], [31] 
12  Balaban  1967  [52] 
14  Bussemaker et al.  1976  [8] 
18  Faradzev  1976  [1] 
20  McKay et al.  1986  [13] 
24  Brinkmann  1992  [18] 
26  Sanjmyatav et al.  2000  [51] 
32  Brinkmann et al.  2011  [7] 
Quoting from Meringer 1999 [43], “The construction of complete lists of regular graphs up to isomorphism is one of the oldest problems in constructive combinatorics.” A recent survey paper on the history of generation of cubic graphs, Brinkmann et al. 2013 [20] lists many of the early papers and key developments in this area. In the century, Vries [30], [31] enumerated all cubic graphs until order . Balaban 1967 [52] enumerated all 3regular graphs up to order 12. Bussemaker et al. 1976 [8] enumerated and showed that the number of cubic graphs with order up to is .
The number of connected cubic graphs obtained from Robinson et al. 1983 [56] is 117 940 535 for order 24, and 8832736318937756165 for order 40.
The number of cubic bipartite graphs with order is given as in a recent study by Brinkmann et al. 2013 [22]. Quoting from [22], “Cubic graphs (alias trivalent graphs) constitute an important family of graphs that are worth enumerating and generating.”
Table 2 shows important papers in the history of enumeration of cubic graphs until order 32, and enumeration of cubic graphs for orders greater than 32 is currently unresolved.
2.3 Enumeration of classes of cubic graphs
The enumeration of cubic symmetric graphs that began with the Foster Census [58] up to order and recently generalized to order by Conder et al. [40] and available at https://www.math.auckland.ac.nz/~conder/symmcubic10000list.txt is an important application of the classification of finite, simple groups. The enumeration of cubic vertextransitive graphs by Potočnik et al. [45], [44] in is a logical extension of the enumeration of cubic symmetric graphs. Cubic symmetric graphs are a subset of cubic vertextransitive graphs. These enumerations are important from a wider graph theory perspective, because they provide new knowledge about the class of graphs being enumerated and also provide useful data of interest to other problems from graph theory. For example, the enumerations of cubic vertextransitive graphs have been used to confirm the order of smallest vertextransitive graph until in [45].
The number of nonisomorphic cubic vertextransitive graphs of order of at most 1280 is mentioned as 111360 by Potočnik et al. in 2012.
2.4 Extremal graph theory and cage problem
The subject of extremal graph theory originated in the s due to Turan and Erdos. Extremal graph theory concerns itself with various invariant properties of a graph. Given any property for a class of graphs, an extremal graph theory question would be to determine the smallest value of a graph invariant such that it satisfies the specified property.
The known lower and upper bounds for the cubic cage problem are extremely wide for larger values of girth , and hence finding better bounds and more cages is a challenging problem. The latest list of known cages is available at [23].
Computational methods have been used to improve lower bounds of the cage problem by Brinkmann et al. [19] in for graphs, McKay et al. [14] in for graphs, and by Exoo et al. [25] in for graphs by showing the nonexistence of graphs with less than order , and finding a graph with order . The lower bound for graphs was improved from to by McKay et al. [14] in .
2.5 Other lists of graphs
The important lists of graphs that we find on the internet are as follows.

http://cs.anu.edu.au/~bdm/data/ Some of the enumerations of graphs are as follows.

Eulerian graphs.

Strongly regular graphs.

Ramsey graphs. A survey can be found in Radziszowski [47] 2014.

Hypohamiltonian graphs.

Planar graphs.

Semiregular bipartite graphs.

Selfcomplementary graphs.

Highly irregular graphs.

Digraphs: Tournaments, Regular and Semiregular Tournaments, Locallytransitive Tournaments, Acyclic digraphs.

Multigraphs


http://www.mathe2.unibayreuth.de/markus/reggraphs.html Meringer [43] 1999 lists many kinds of graphs.

Connected regular graphs with girth at least 6: The number of connected regular graphs with girth at least 6 with order 30 is given as 122090544.

Connected regular graphs with girth at least 4.

Connected regular graphs with girth at least 5.

Connected regular graphs with girth at least 6.

Connected regular graphs with girth at least 7.

Connected regular graphs with girth at least 8.

Connected bipartite regular graphs.

Connected planar regular graphs.


House of Graphs http://hog.grinvin.org Brinkmann et al. [21] 2013 lists graphs from many different sources mentioned above in this survey, but this list does not contain graphs of high girth. For example, a search for graphs with girth greater than or equal to 12 yields only one graph.

Conder at al. 2006 [41] listed a census of cubic semisymmetric graphs until order 768.
The only sources for graphs of high girth are literature of the cage problem and enumerations of cubic vertextransitive and symmetric graphs.
2.6 Other computational approaches to find graphs
2.7 Other related researches
Holton et al. [3] 1985 show that 3connected cubic bipartite planar graphs with orders lesser than are Hamiltonian. After removing the restriction on bipartite graphs, Holton et al. [4] 1988 show that the smallest nonHamiltonian 3connected cubic planar graphs has order . Other studies on regular graphs of high girth are as follows.
2.8 Observations
Some observations from the literature review mentioned earlier in this section are made here as follows.

Difficulty of finding cubic graphs of large girth
As pointed out earlier, there is an inherent difficulty in finding cubic graphs of large girth outside the vertextransitive class. 
Large number of nonisomorphic cubic graphs for orders greater than 32
As we have seen in this section, in general there are a large number of nonisomorphic cubic graphs for a specified order, thus making it practically very difficult to list all of them for orders greater than 32. 
Beyond the class of cubic vertextransitive graphs
The main literature for cubic graphs of high girth are that of the cage problem and enumerations of cubic vertextransitive and symmetric graphs. Given the list of cubic vertextransitive graphs, we can find the vertextransitive graph with the minimum order in the list. The minimum orders for Cayley and vertextransitive graphs are obtained from Potočnik et al. [45] and [44] 2012, and the lower and upper bounds from Exoo et al. 2011 [26] and are shown in Table 3 for even girth . There are two main limitations of currently known listings of graphs. Firstly, there is currently no other known listing of graphs, where the minimum graph within the class is also the smallest known graph for . Secondly, there do not exist vertextransitive graphs for many orders. For example, there does not exist a vertextransitive graph with order less than 80. The smallest three orders for which vertextransitive graphs exist, as mentioned by Potočnik et al. 2012 [45] and [44] are 406, 448 and 480.
3 Catalog
In this section, the approach to graph listing is explained, with the choice of Hamiltonian bipartite class of cubic graphs and focus on efficient representation as a first step towards listing graphs within the identified class. The important steps in the approach to find graphs of high girth can be described as follows.

The search space for computer search is restricted to Hamiltonian bipartite class of cubic graphs.

An efficient representation for Hamiltonian cubic bipartite graphs with a specified level of rotational symmetry.

A range of rotational symmetries are chosen for each value of such that a HBG with that level of rotational symmetry could be found by computer search.

We treat graphs of a particular level of rotational symmetry within the identified class of cubic graphs as a subclass, and seek to list at least one representative from each subclass.
3.1 Approach
The number of Hamiltonian cubic bipartite graphs are too numerous in order to practically enumerate them. Thus, as a first step, we try to list HBGs for each order for which HBGs exist until . The number is motivated by the following open problem, “Finding an infinite family of cubic graphs with large girth and order for .” from Exoo et al. [26] 2011. A computational approach for finding and listing HBGs for even girth for a range of orders until and hence find a HBG with the minimum order, has been introduced.
Hamiltonian bipartite have been identified as a promising class of cubic graphs for obtaining graphs of high even girth . Every HBG of minimum order is also a cage for even girth . Hamiltonian cubic bipartite graphs represent one quadrant in the space of cubic graphs as shown in Figure 1. The other three quadrants are Hamiltonian nonbipartite graphs, nonHamiltonian bipartite graphs and nonHamiltonian nonbipartite graphs. There are no known enumeration methods for cubic graphs outside the set of cubic vertextransitive graphs other than this research.
The traditional method to represent a labeled graph is by its adjacency list. The LCF notation for representing Hamiltonian cubic graphs was introduced by Lederberg in [34] and by Frucht in [46].
The motivation for a compact notation for Hamiltonian cubic bipartite graph is as follows.

To represent any Hamiltonian cubic bipartite graph using fewer variables compared to the entire adjacency list.

To represent any Hamiltonian cubic bipartite graph using fewer variables compared to the LCF notation.
Even though the LCF notation is extremely convenient for representing a cubic HBG, it is not a minimal representation, and one of the motivations here is to propose a more compact graph representation format that would be practically useful in order to represent HBGs and also find HBGs by computer search. The D3 chord index notation for representing Hamiltonian cubic bipartite graphs, and a parameter called symmetry factor for a Hamiltonian cubic graph with order , where that reflects the extent of rotational symmetry are introduced as part of this work. As pointed out earlier, symmetry factor is very similar to the concept of exponent used in the LCF notation.
In general, any HBG of order can be completely specified by the order and length of chords connected from alternate nodes. The concept of D3 chord index is introduced as length of chords connected from alternate nodes of a HBG and is formally introduced in Definition 7. Thus, it is clear that any HBG has a D3 chord index representation. Further, by considering rotational symmetry along the Hamiltonian cycle, the concept of symmetry factor is introduced in Definition 8.
For a HBG of order with rotational symmetry along Hamiltonian cycle, the D3 chord indices would typically look something like .
Hence, the same HBG can be more compactly represented by D3 chord indices , symmetry factor and order , assuming that divides .
For other kind of symmetries such as folding symmetry, we would in general need to use the full symmetry factor representation.
Definition 7.
D3 chord index notation
The D3 chord indices for order where each is an odd integer satisfying for is a labeled graph with order , with labels constructed as follows.

Vertex is connected to vertex , vertex and vertex .

For integers satisfying ,

Vertex is connected to vertex .

Vertex is connected to vertex .

Vertex is connected to vertex .
where is calculated as follows.

if .

if .

Definition 8.
Symmetry factor for Hamiltonian cubic bipartite graph
A Hamiltonian cubic bipartite graph with order is said to have symmetry factor if the following conditions are satisfied.

divides .

There exists a labelling of the vertices of the Hamiltonian cubic graph with order have labels , such that is a Hamiltonian cycle that satisfy the following properties.

The edges that are not part of the above Hamiltonian cycle are connected as follows. Vertex is connected to vertex for .

If for and then the following is true, .

Figure 2 shows an example of a Cage with order and symmetry factor .
Theorem 1.
If a Hamiltonian cubic bipartite graph with symmetry factor has girth then .
Proof.
Let us visualize a cycle of length with vertices numbered . If vertex is connected to vertex and vertex to vertex , then we have a cycle of length . Since we obtain as required. ∎
The notation D3 is used to refer to D3 chord indices for a Hamiltonian cubic bipartite graph with symmetry factor and order where .
The D3 chord indices for the cage shown in Figure 2 are 9 13 29 21 13 43 33 with symmetry factor 7. The LCF representation for the same graph is [29, 19, 13, 13, 21, 27, 27, 33, 13, 13, 19, 21, 33, 29]. The D3 chord index notation is twice as compact as the LCF notation for Hamiltonian cubic bipartite graphs.
3.2 Summary of catalog
This catalog has been obtained by computer search for HBG by enumerating the space of D3 chord indices for a specified order and symmetry factor. The current approach is to exit the search when a representative HBG is found for a particular order and symmetry factor. A summary of the catalog has been provided in Table 4. Symmetry factor allows the decomposition of the problem of listing HBGs to subproblems of listing HBGs for a range of symmetry factors. This catalog of HBG is infinite, and a more detailed discussion is provided in [49].
This computational approach to find a HBG with a particular symmetry factor , and specified order , can conclude that such as HBG does not exist, or at times even be inconclusive on whether such a HBG exists or not.
The listing of HBGs for a particular even value of girth until is considered to be exhaustive if all orders in specified range that have a HBG are listed, with proof for nonexistence for orders not listed.
The outcome for listing of HBGs is partial if results on existence HBG for some orders in specified range until are inconclusive.
A listing of HBGs for a particular symmetry factor is considered to be monotonic, when there exists an order for which the smallest HBG with symmetry factor exists, such that there exist at least one HBG with symmetry factor exists for all orders , where is a natural number. If a listing of HBGs for a particular symmetry factor is not monotonic, it is considered to be nonmonotonic.
In Table 4, the smallest HBGs for various symmetry factors have been listed.
1  14, Cage  
2  36  80  
3  30, Cage  90  162  
4  40  72  216  440  
5  40  80  190  460  
6  36  84  168  456  
7  14, Cage  42  70, Cage  182  406  
8  48  80  208  384, Record  
9  54  90  126, Cage  504  
10  40  80  200  520  
11  44  88  506  
12  48  72  216  576  
13  52  572  
14  56  588  
15  30, Cage  600  
16  64  576  
35 
Color  Significance 

subproblem resolved between known lower and upper bound  
Upper bound subproblem for HBGs found, but open to improvement  
Upper bound HBG subproblem resolved  Does Not Exist  
HBG subproblem is inconclusive 
The lower bound for is known to be 258 as per [26]. The lower bound for a HBG for a particular symmetry factor , would be the smallest positive integer greater than or equal to 258 that is also divisible by , which we denote as . The lower bounds for some symmetry factors that have improved as part of this research are shown in Table 5.
Symmetry  Lower bound HBG  Upper bound HBG  

factor  for symmetry factor factor  for symmetry factor  
3  258  900  
4  264  440  440 
5  260  460  460 
6  264  456  456 
7  266  364  406 
8  272  304  384 
9  270  288  504 
10  260  260  460 
11  264  264  506 
12  264  264  456 
13  260  260  572 
14  280  280  588 
15  270  270  510 
16  288  288  384 
Color  Significance 

Found to not exist  
Lower bound equals upper bound  
Lower bound improved over  
Scope for potentially improving bounds 
384 refers to the Record graph
An example from this catalog of graphs is provided in Figure 3, which shows that HBGs exist for all even orders greater than or equal to 14. An example from this catalog of graphs is provided in Figure 3, which shows that HBGs with symmetry factor exist for all even orders greater than or equal to 40. Hence, both these examples can be considered monotonic.
A nonmontonic example from this catalog of graphs is provided in Figure 5, which shows that HBGs with symmetry factor exist for all even orders greater than or equal to 42, there does not exist a HBGs with symmetry factor with order 36, even though the smallest HBGs with symmetry factor is of order 30 and is the cage.
Order  10  12  14  16  18  
Existence  
Figure  
D3  5  5  5  5 
Order  32  40  48  56  64  
Existence  
Figure  
D3  7 9  7 19  7 9  7 9  7 9  
13 15  7 19  13 15  13 15  13 15 
Order  30  36  42  48  54  
Existence  
Figure  
D3  7 9  7 9  7 9  7 9  7 9  
17  23  17  29  17 
The minimum observed symmetry factor and lower bound predicted by Theorem 1 for HBGs for even values of girth has been plotted in Table 6. The minimum observed symmetry factor exactly matches the lower bound predicted by Theorem 1 for HBGs, HBGs, HBGs and HBGs, while the minimum observed symmetry factor is greater than the lower bound predicted By Theorem 1 for HBGs and HBGs. Hence, it is indeed likely that there might exist a HBG with symmetry factor less than .
3.3 Completeness and correctness of the catalog
As pointed out earlier, this catalog [48] does not aim to be complete by listing all HBGs for a given order, since currently only one HBG from a representative class of order, girth and symmetry factor is listed. There are many instances of multiple HBGs of the same order and girth on the catalog [48], with different symmetry factors. From the perspective of correctness of the catalog [48], order of HBG is correct by construction, girth of the HBG is checked using a computer program. As pointed out earlier, every HBG has a D3 chord index representation. The conclusion about nonexistence of a HBG with specified order, girth and symmetry factor is arrived after computer search of the entire space of D3 chord indices corresponding to the order and symmetry factor.
4 Findings
The key findings of this work are as follows. Some of these points have been referred to in earlier sections, but have been listed explicitly here in order to make them clearer. A more detailed discussion of Table 7 has been provided in [49].
Until  Hamiltonian  Vertex  Symmetric  

graphs  order  bipartite  transitive  
50  19  19  10  
90  29  21  6  
160  29  15  7  
400  84  26  16  
1000  164  35  11 

Finding 1: Identification of HBGs as a promising class of cubic graphs
HBGs have been identified, as a promising class of cubic graphs that can lead to a catalog of graphs for even girth with graphs for more orders than other listings, that is also expected to contain a graph with minimum order. This is the first known work to list HBGs of specified even girths, with the obtained catalog having graphs for larger number of distinct orders than the previous lists, and includes the cage for and , one cage and the record graph. 
Finding 2: This catalog has graphs for more orders compared to other lists

Result on existence of a HBG for each order for which vertextransitive graphs exist, whether bipartite or nonbipartite for chosen intervals of comparison for even girth until . For comparison with vertextransitive graphs, we consider graphs until order , graphs until order , graphs until order , graphs until order and graphs until order , as shown in Table 7.

The catalog provides detailed information on existence of HBGs for each order, with symmetry factors for which graphs have been found, symmetry factors for which graphs have been proven not to exist, and symmetry factors for which the existence of the graph have been found to be inconclusive. The details of this are provided in [49].

Large number of graphs outside the vertextransitive class: There are many orders for which a vertextransitive graph does not exist, for which HBG exists on this catalog, as seen in Table 7.

The catalog of HBGs are exhaustive with graphs for each order in specified range with proof of nonexistence for orders of graphs not listed for and partial for , and due to some inconclusive results for some subclasses.


Finding 3: Graph representation relevant for this research

Symmetry factor has been introduced for representing the level of rotational symmetry in cubic Hamiltonian bipartite graphs. Symmetry factor allows decomposing the problem of listing HBGs for even girth for a range of orders into subproblems of listing HBGs for a specified symmetry factor for a range of orders, and hence allows listing of HBGs for more orders.

D3 chord index notation has been introduced, which is twice as compact as the LCF notation for representing cubic Hamiltonian bipartite graphs.

The D3 chord index notation can specify an infinite family of HBGs, for different orders greater than a threshold value.
Example 1.
D3 chord index 5 leads to a HBG for all even orders greater than or equal to as shown in Figure 3. This has been proved theoretically and practically verified until order .
Example 2.
It is practically observed that D3 chord indices
leads to HBGs for orders for integers , for symmetry factor . In addition, it is also observed that the above mentioned D3 chord indices also lead to HBGs for the following orders
.



Finding 4: Extremal graph theory perspective
The following questions from an extremal graph theory perspective have been raised.Question 1.
Given a specified symmetry factor , what is the minimum order for the existence of a HBG?
Question 2.
“Given a specified even value of girth , what is the minimum value of symmetry factor for existence of a HBG?”
Question 1 and question 2 are important in order to understand the relationship between symmetry factor , girth and order for HBGs. This research provides lower bounds and upper bounds on minimum order for the existence of a Hamiltonian bipartite graph for a specified symmetry factor for even girth in Question 1, with the lower bound being equal to the upper bound for many cases. For example, for Hamiltonian bipartite graphs the corresponding lower bound and upper bounds are equal for symmetry factors 4, 5 and 6, as shown in Table 5. This research provides a theoretical lower bound and empirical data for the minimum value of symmetry factor for a Hamiltonian bipartite graph for a range of even girth for Question 2. For example, the minimum value of symmetry factor for HBGs is 1, and for HBGs is 2, as shown in Table 6.

Finding 5: Cage problem perspective
Results on nonexistence of HBGs for some orders and symmetry factors that show the emptiness of subclasses of graphs are of wider interest. For example, for graphs, the lower bound is 258 and upper bound is 384, the nonexistence of HBGs between orders 258 and 384 for symmetry factors 4, 5, 6, and emptiness of many other subclasses as per the nonexistence lists, has been shown as discussed in [50].

5 Limitations and open problems
5.1 Restrictions to this approach
Some of the restrictions and limitations of this approach are as follows.

The scope of this approach is restricted to cubic HBGs.

This approach is restricted to even values of girth.

Results on existence or emptiness of some subclasses of HBGs for some orders, symmetry factor and even girth are inconclusive.

The size of the automorphism group for each graph is not computed.
5.2 Open problems
The following open problems on graphs arise out this research.
Open problem 1.
Given an arbitrary even number greater than 14, what is the maximum attainable girth of cubic graphs with order ?
In general, it might not be very straightforward to find the maximum attainable girth of cubic bipartite graphs for a specified even order. The catalog [48] suggests that the maximum attainable girth for cubic graphs for orders is 6, for orders is 8, and it is well known that it is 8 for order 30, since .
Open problem 2.
Let be the maximum attainable girth in the space of cubic bipartite graphs with specified even order greater than 14. Does there always exist a HBG with order for all even values of girth satisfying ?
The catalog [48] introduced in this paper suggests that the answer to open problem 2 might be yes, but it is not currently known whether this is true in general. As pointed out earlier, the research of Haythorpe 2014 [42] suggests that nonHamiltonian cubic graph of minimum order is always larger than a Hamiltonian cubic graph of minimum order. It is indeed likely that this might be true in general. Hence, open problem 3 is raised.
Open problem 3.
Given , if is the maximum attainable girth in the space of all possible cubic bipartite graphs with order , then does there exist a bipartite graph with order that is not Hamiltonian?
As pointed out earlier, it is well known that all the known cages for even girth are Hamiltonian. The cage found by McGee 1960 [57] and cage found by Balaban 1973 [5] are known to be Hamiltonian, and the eighteen cages which were shown to be complete by Brinkmann et al. 1995 [6] have been checked by this author and found to be Hamiltonian as well. Hence, open problem 4 is raised.
Open problem 4.
Does every cage, other than the known exception of the cage, the Petersen graph, have a Hamiltonian cycle?
Open problem 5 ia raised on size of its automorphism group of a cubic HBG. In general, finding the automorphism group of a graph is known to be a difficult problem. Quoting from Lauri J. et al [33], “The problem of determining whether a graph has a nontrivial automorphism is in NP, since, given such a permutation of the vertices, it is easy to determine in polynomial time that it is an automorphism.” If we consider the class of circulant graphs, the automorphism group is known in very few cases as pointed out by Morris [35].
Open problem 5.
For size of automorphism group
Given the D3 chord indices for a cubic HBG, what can one say about the size of its automorphism group?
Footnotes
References
 Faradzev I. A. Constructive enumeration of combinatorial objects. Colloques internationaux C.N.R.S. No 260  Problemes Combinatoires et Theorie des Graphes, Orsay, pages 131–135, 1976.
 Goldberg L. A. Efficient algorithms for listing unlabeled graphs. Journal Of Algorithms, 13:128–143, 1992.
 Holton D. A., Manvel B., and McKay B. D. Hamiltonian Cubic 3Connected Cubic Bipartite Planar Graphs. Journal Of Combinatorial Theory, Series B, 38(3), 1985.
 Holton D. A. and McKay B. D. The smallest nonHamiltonian 3connected cubic planar graphs have 38 vertices. Journal Of Combinatorial Theory, Series B, 45(3):468–488, 1988.
 Balaban A.T. Trivalent graph of girth nine and eleven and relationships among the cages. Rev. Roumaine Math., 18:1033–1043, 1973.
 McKay B. D. Brinkmann G. and Saager C. The smallest cubic graphs of girth nine. Combin. Probab. Comput., 5:1–13, 1995.
 McKay B. D. Brinkmann G., Goedgebeur J. Generation of cubic graphs. Discrete Mathematics and Theoretical Computer Science, 2011.
 Bussemaker F. C., Cobeljic S., Cvetkovic D. M., and Seidel J. J. Computer investigation of cubic graphs. Technical report, Technical Report T.H.Report 76WSK01, Department of Math. Technological University Eindhoven, The Netherlands, 1976.
 Read R. C. A survey of graph generation techniques. Lecture Notes in Mathematics, 884:77–89, 1981.
 Powers D. L. Coxeter H.S.M., Frucht R. Zerosymmetric graphs : trivalent graphical regular representations of groups. Academic Press, 1981.
 McKay B. D. Independent sets in regular graphs of high girth. Ars Combinatorica, 23A:179–185, 1987.
 McKay B. D. and Spence E. Classification of regular twographs on 36 and 38 vertices. Australasian Journal of Combinatorics, 24:293, 2001.
 McKay B. D. and Royle G. F. Constructing the cubic graphs on up to 20 vertices. Ars Combinatorica, 21A:129–140, 1986.
 McKay B. D., Myrvold W., and Nadon J. Fast backtracking principles applied to find new cages. In Proceedings of the ninth annual ACMSIAM symposium on Discrete algorithms, SODA ’98, Society for Industrial and Applied Mathematics Philadelphia, PA, USA, pages 188–191, 1998.
 Spence E. Regular twographs on 36 vertices. Linear Algebra and its Applications, pages 226–228, 459–497, 1995.
 Spence E. The strongly regular (40,12,2,4) graphs. Electronic Journal of Combinatorics, 7(1), 2000.
 Harary F. and Palmer E. M. Graphical Enumeration. Academic Press, 1973.
 Brinkmann G. Generating cubic graphs faster than isomorphism checking. Technical report, Technical report, SFB 343, Universitat Bielefeld, 1992.
 Brinkmann G., McKay B. D., and Saager C. The smallest cubic graphs of girth nine. Combin. Probab. Comput., 5:1–13, 1995.
 Brinkmann G., Goedgebeur J., and Cleemput N.V. The history of the generation of cubic graphs. International Journal of Chemical Modeling, 5(23):67–89, 2013.
 Brinkmann G., Coolsaet K., Goedgebeur J., and Melot H. House of graphs: a database of interesting graphs. Discrete Applied Mathematics, 161(1–2):311–314, 2013.
 Brinkmann G., Cleemput N. V., and Pisanki T. Generation of various classes of trivalent graphs. Theoretical Computer Science, 502:16–29, 2013.
 Exoo G. Regular graphs of given degree and girth. http://ginger.indstate.edu/ge/CAGES.
 Exoo G. A small trivalent graph of girth 14. The Electronic Journal Of Combinatorics, 9, 2002.
 Exoo G., McKay B. D., Myrvold W. J., and Nadon J. Computational determination of (3, 11) and (4, 7) cages. J. Discrete Algorithms, 9(2):166–169, 2011.
 Exoo G. and Jajcay R. Dynamic cage survey. Electronic Journal of Combinatorics, 18(DS16), 2011.
 Baker H. H., Dewdney A. K., and Szilard A. L. The production of graphs by computer. Mathematics of Computation, 28(127):833–838, 1974.
 B.R. Heap. The production of graphs by computer. Graph Theory and Computing, Academic Press, 68:47–62, 1972.
 Kagno I. Linear graphs of degree less than 7 and their groups. American Journal of Mathematics, 68:505–529, 1946.
 DeVries J. Over vlakke configuraties waarin elk punt met twee lijnen incidentis. Verslagen en Mededeelingen der Koninklijke Akademie voor Wetenschappen, Afdeeling Natuurkunde, 3(6):382–407, 1889.
 DeVries J. Sur les configurations planes dont chaque point supporte deux droites. Rendiconti Circolo Mat. Palermo, 5:221–226, 1891.
 Hoare M. J. On the girth of trivalent Cayley graphs. graphs and other combinatorial topics. In Proceedings of the Third Czechoslovak Symposium on Graph Theory, Prague 1982, Teubner, Leipzig, pages 109–114, "" 1983.
 Lauri J. and Scapellato R. Topics in Graph Automorphisms and Reconstruction. Cambridge University Press, London Mathematical Society Lecture Note Series 432, 2016.
 Lederberg J. A system for computer construction, enumeration and notation of organic molecules as tree structures and cyclic graphs. Technical report, Part 11: Topology of cyclic graphs. Interim Report, Stanford, 1965.
 Morris J. Automorphism groups of circulant graphs  a survey. draft.
 Coolsaet K., Degraer J., and Spence E. The strongly regular (45,12,3,3) graphs. Electronic Journal of Combinatorics, 13(1), 2006.
 Wong P. K. Cages a survey. Journal of Graph Theory, 6:1–22, 1982.
 Lovasz L. Combinatorial structures and their applications. Proc. Calgary Internat. Conf., Calgary, Alberta, 1969, Problem 11, Gordon and Breach, New York:243–246, 1970.
 Rodriquez L. Automorphism groups of simple graphs. https://www.whitman.edu/Documents/Academics/Mathematics/2014/rodriglr.pdf.
 Conder M. Small trivalent graphs of large girth. Technical report, University of Auckland Centre for Discrete Mathematics and Theoretical Computer Science Research Report Series, 1997.
 Conder M., Malnic A., Marusic D., and Potočnik P. A census of semisymmetric cubic graphs on up to 768 vertices. Journal of Algebraic Combinatorics, 23:255–294, 2006.
 Haythorpe M. NonHamiltonian 3–regular graphs with arbitrary girth. Universal Journal of Applied Mathematics, 2(1):72–78, 2014.
 Meringer M. Fast Generation of Regular Graphs and Construction of Cages. Journal of Graph Theory, 30:137–146, 1999.
 Potočnik P., Spiga P., and Verret G. Bounding the order of the vertexstabiliser in 3valent vertextransitive and 4valent arctransitive graphs. arXiv:1010.2546v1 [math.CO].
 Potočnik P., Spiga P., and Verret G. Cubic vertextransitive graphs on up to 1280 vertices. Journal of Symbolic Computation, 50:465–477, 2013.
 Frucht R. A canonical representation of trivalent Hamiltonian graphs. Journal of Graph Theory, 1(1):45–60, 1976.
 Radziszowski. Small Ramsey Numbers. THE ELECTRONIC JOURNAL OF COMBINATORICS, DS1.14, 2014.
 Nittoor V. S. A catalog of Hamiltonian bipartite graphs. draft.
 Nittoor V. S. Some properties of catalog of (3, g) hamiltonian bipartite graphs: orders, nonexistence and infiniteness. arXiv:1601.02887 [math.CO].
 Nittoor V. S. Subproblems of the cage problem and their computer analysis. arXiv:1612.07683 [math.CO].
 Sanjmyatav S. Algorithms for generation of cubic graphs. Master’s thesis, Australian National University, 2000.
 Balaban A. T. Valenceisomerism of cyclopolyenes. Revue Roumaine de chimie, 11(12):1097–1116,103 (erratum), 1967.
 Balaban A. T. A trivalent graph of girth ten. Journal of Combinatorial Theory, 12:1–5, 1972.
 Tutte W. T. A family of cubical graphs. Proceedings of the Cambridge Philosophical Society, 43:459–474, 1947.
 Haemers W. and Spence E. The pseudogeometric graphs for generalised quadrangles of order (3,t). European Journal of Combinatorics, 22(6):839–845, 2001.
 Robinson R. W. and Wormald N. C. Numbers of cubic graphs. Journal of Graph Theory, 7:463–467, 1983.
 McGee W.F. A minimal cubic graph of girth seven. Canad. Math. Bull., 3:149–152, 1960.
 Bouwer Z., Chernoff W. W., Monson B., and Star Z. The Foster census. Technical report, Charles Babbage Research Centre, 1988.