Previous months: - 0908(1) - 1001(3) - 1003(2) - 1004(1) - 1006(1) - 1009(1)
[9] viXra:1009.0014 [pdf] submitted on 13 Mar 2010
Authors: Florentin Smarandache
Comments:
3 pages.
Sudoku is a game with numbers, formed by a square with the side of 9, and on each row and column are placed the digits 1, 2, 3, 4, 5, 6, 7, 8, 9, written only one time; the square is subdivided in 9 smaller squares with the side of 3x3, which, also, must satisfy the same condition, i.e. each square to contain all digits from 1 to 9 written only once.
[8] viXra:1006.0062 [pdf] submitted on 25 Jun 2010
Authors: W. B. Vasantha Kandasamy, Florentin Smarandache, K. Ilanthenral
Comments: 163 pages
The new classes of super special codes are constructed in this book using the specially constructed super special vector spaces. These codes mainly use the super matrices. These codes can be realized as a special type of concatenated codes.
[7] viXra:1004.0018 [pdf] submitted on 8 Mar 2010
Authors: Florentin Smarandache, Sukanto Bhattacharya
Comments: 7 pages
We have posed a simple but interesting graph theoretic problem and posited a heuristic solution procedure, which we have christened as Vectored Route-length Minimization Search (VeRMinS). Basically, it constitutes of a re-casting of the classical "shortest route" problem within a strictly Euclidean space. We have only presented a heuristic solution process with the hope that a formal proof will eventually emerge as the problem receives wider exposure within mathematical circles.
[6] viXra:1003.0229 [pdf] submitted on 7 Mar 2010
Authors: Linfan Mao
Comments: 275 pages
A Smarandache multi-space is a union of n different spaces equipped with some different structures for an integer n ≥ 2, which can be used both for discrete or connected spaces, particularly for geometries and spacetimes in theoretical physics.
[5] viXra:1003.0223 [pdf] submitted on 7 Mar 2010
Authors: Linfan Mao
Comments: 215 pages
SMARANDACHE GEOMETRIES & MAP THEORY WITH APPLICATIONS
[4] viXra:1001.0031 [pdf] submitted on 22 Jan 2010
Authors: Dainis Zeps, Emanuels Grinbergs
Comments: 6 pages
We will call graph 1-H-graph if it is threeconnected and it has only one Hamiltonian circuit
[3] viXra:1001.0030 [pdf] submitted on 22 Jan 2010
[2] viXra:1001.0029 [pdf] submitted on 22 Jan 2010
Authors: Dainis Zeps
Comments: 4 pages
4-critical wheel graphs of higher order are considered concerning their belonging to free-planar or free-Hadwiger classes.
[1] viXra:0908.0051 [pdf] submitted on 10 Aug 2009
Authors: Hamid V. Ansari
Comments: 15 pages
To color a given map we first find its related map with the most mutual adjacencies and color it by only four colors, then we trace back.
None