Regular graph G

In recent years, determining the parameter of strongly regular graph is a important problem of the theory graph. However, when the number of vertices of a strongly regular graph (called n) is any number, determining its parameter is very difficult and nobody can solve this problem.

15p larachdumlanat127 20-12-2020 7 1   Download

The cage problem asks for the construction of regular graphs with specified degree and girth. Reviewing terminology, we recall that the girth of a graph is the length of a shortest cycle, that a (k, g)-graph is regular graph of degree k and girth g, and that a (k, g)-cage is a (k, g)-graph of minimum possible order. Define f(k, g) to be this minimum. We focus on trivalent (or cubic) cages. It is well known that...

7p thulanh5 12-09-2011 62 4   Download