The first part of this paper classifies all purely cubic function fields over a finite field of characteristic not equal to 3. In the remainder, we describe a method for computing the fundamental unit and regulator of a purely cubic congruence function field of unit rank 1 and characteristic at least 5. The technique is based on Voronoi’s algorithm for generating a chain of successive minima in...

Let Sg be the orientable surface of genus g for a fixed non-negative integer g. We show that the number of vertex-labelled cubic multigraphs embeddable on Sg with 2n vertices is asymptotically cgn 5/2(g−1)−1γ2n(2n)!, where γ is an algebraic constant and cg is a constant depending only on the genus g. We also derive an analogous result for simple cubic graphs and weighted cubic multigraphs. Addi...

The first part of this paper classifies all purely cubic function fields over a finite field of characteristic not equal to 3. In the remainder, we describe a method for computing the fundamental unit and regulator of a purely cubic congruence function field of unit rank 1 and characteristic at least 5. The technique is based on Voronoi’s algorithm for generating a chain of successive minima in...

In this paper, a semi-analytic thermal stress computation for single crystals with cubic anisotropy is developed, by introducing a new anisotropic factor. Based on a suitable splitting of the differential operators, a convergence series for general elasticity problem with cubic anisotropy is derived. Each term of the series is related to an isotropic elasticity problem. Using the analytic solut...

Operations of cubic soft sets including "AND" operation and "OR" operation based on P-orders and R-orders are introduced and some related properties are investigated. An example is presented to show that the R-union of two internal cubic soft sets might not be internal. A sufficient condition is provided, which ensure that the R-union of two internal cubic soft sets is also internal. Moreover, ...

We establish that every cyclically 4-connected cubic planar graph of order at most 40 is hamiltonian. Furthermore, this bound is determined to be sharp and we present all nonhamiltonian such graphs of order 42. In addition we list all nonhamiltonian cyclically 5-connected cubic planar graphs of order at most 52 and all nonhamiltonian 3-connected cubic planar graphs of girth 5 on at most 46 vert...

In this paper a piece of a conic section is approximated by a cubic or piecewise cubic polynomial. The main tool is to define the two inner control points of the cubic as an affine combination, defined by λ ∈ [0, 1], of two control points of the conic. If λ is taken to depend on the weight w of the latter, a function λ(w) results which is used to distinguish between different algorithms and to ...

In this study, we presented the concept of neutrosophic cubic set by extending the concept of cubic set to neutrosophic set. We also defined internal neutrosophic cubic set (INCS) and external neutrosophic cubic set (ENCS). Then, we proposed some new type of INCS and ENCS is called 1 3 -INCS (or 2 3 -ENCS ), 2 3 -INCS(or 1 3 -ENCS). Then we study some of their relevant properties. Finally, we i...

Jorgensen, L.K., Nonexistence of certain cubic graphs with small diameters, Discrete Mathematics 114 (1993) 2655273. We consider the maximum number of vertices in a cubic graph with small diameter. We show that a cubic graph of diameter 4 has at most 40 vertices. (The Moore bound is 46 and graphs with 38 vertices are known.) We also consider bipartite cubic graphs of diameter 5, for which the M...

In a previous paper analytical equations were derived for the packing fraction of crystalline structures consisting of bimodal randomly placed hard spheres [H. J. H. Brouwers, Phys. Rev. E 76, 041304 (2007)]. The bimodal packing fraction was derived for the three crystalline cubic systems: viz., face-centered cubic, body-centered cubic, and simple cubic. These three equations appeared also to b...