advance a modern extension formation of cubic vague sets identified as interval (CIVSs). similarly describe the idea (ICIVSs) (ECIVSs) by examples debate their exciting properties, excluding ICIVSs ECIVSs - . Additionally, show ( ECIVSs) necessity not be an ICIVS (or ECIVS). apply (CIVS) to topological spaces and present spaces. Further, we introduce P-cubic space R-cubic space. We discuss basi...

A successful heuristic algorithm for nding Hamilton cycles in cubic graphs is described Several graphs from The Foster census of connected symmetric trivalent graphs and all cubic Cayley graphs of the group PSL are shown to be hamiltonian Proposed running head HAMILTON CYCLES IN CUBIC GRAPHS

The idea of (combinatorial) Gray codes is to list objects in question in such a way that two successive objects differ in some pre-specified small way. In this paper, we utilize β-description trees to cyclicly Gray code three classes of cubic planar maps, namely, bicubic planar maps, 3-connected cubic planar maps, and cubic non-separable planar maps.

All cubic partial cubes (i.e., cubic isometric subgraphs of hypercubes) up to 30 vertices and all edge-critical partial cubes up to 14 vertices are presented. The lists of graphs were confirmed by computer search to be complete. Non-trivial cubic partial cubes on 36, 42, and 48 vertices are also constructed.

The idea of (combinatorial) Gray codes is to list objects in question in such a way that two successive objects differ in some pre-specified small way. In this paper, we utilize β-description trees to cyclicly Gray code three classes of cubic planar maps, namely, bicubic planar maps, 3-connected cubic planar maps, and cubic non-separable planar maps.

We show that every (sub)cubic n-vertex graph with sufficiently large girth has fractional chromatic number at most 2.2978 which implies that it contains an independent set of size at least 0.4352n. Our bound on the independence number is valid to random cubic graphs as well as it improves existing lower bounds on the maximum cut in cubic graphs with large girth.

We study p-adic root separation for quadratic and cubic polynomials with integer coefficients. The quadratic and reducible cubic polynomials are completely understood, while in the irreducible cubic case, we give a family of polynomials with the bound which is the best currently known.

This paper deals with the shape preserving C rational cubic interpolation. The developed rational cubic interpolating function has only one free parameter. The approximation order of rational cubic function is investigated and range of optimal error constant is determined. Moreover, positive, constrained and monotone data preserving schemes are developed. 2000 Mathematics Subject Classification...

We study the equivalence problem of cubic forms. We lower bound its complexity by that of F-algebra isomorphism problem and hence by the graph isomorphism problem (for all fields F). For finite fields we upper bound the complexity of cubic forms by NP∩coAM. We also study the cubic forms obtained from F-algebras and show that they are regular and indecomposable.