Previous months: - 0908(1) - 1001(3) - 1003(4) - 1004(1) - 1006(1) - 1009(1) - 1010(1) - 1101(1) - 1103(1) - 1106(1)
Any replacements are listed further down
[13] viXra:1106.0053 [pdf] submitted on 27 Jun 2011
Authors: Paul A. Titze
Comments: 18 pages, 19 figures.
fix a ship's position in charted interstellar space with the assistance of
a three dimensional computer based stellar chart and star camera spectrometers
capable of measuring angular separations between three sets of
pair stars. The method offers another tool for the navigator to rely on if
alternative position fixing methods are not available or if the navigator
wishes to verify the validity of one's position given by other means.
Category: Combinatorics and Graph Theory
[12] viXra:1103.0032 [pdf] submitted on 11 Mar 2011
Authors: Linfan Mao
Comments: 16 pages
An interesting symmetry on multiplication of numbers found by
Prof.Smarandache recently. By considering integers or elements in groups on
graphs, we extend this symmetry on graphs and find geometrical symmetries.
For extending further, Smarandache's or combinatorial systems are also
discussed on general mathematical systems in this paper, particularly, the CC
conjecture presented by myself six years ago, which enables one to construct
symmetrical systems in mathematical sciences.
Category: Combinatorics and Graph Theory
[11] viXra:1101.0095 [pdf] submitted on 28 Jan 2011
Authors: Yilun Shang
Comments: 5 pages
An edge-colored graph G is rainbow edge-connected if any two vertices are connected
by a path whose edges have distinct colors. The rainbow connection of a connected
graph G, denoted by rc(G), is the smallest number of colors that are needed in
order to make G rainbow connected. Similarly, a vertex-colored graph G is rainbow
vertex-connected if any two vertices are connected by a path whose internal vertices
have distinct colors. The rainbow vertex-connection of a connected graph G, denoted
by rvc(G), is the smallest number of colors that are needed in order to make G rainbow
vertex-connected. We prove that both rc(G) and rvc(G) have sharp concentration in
classical random graph model G(n, p).
Category: Combinatorics and Graph Theory
[10] viXra:1010.0025 [pdf] submitted on 13 Oct 2010
Authors: Dainis Zeps
Comments: 14 pages
We consider combinatorial maps with fixed combinatorial knot numbered with
augmenting numeration called normalized knot. We show that knot's normalization
doesn't affect combinatorial map what concerns its generality. Knot's normalization
leads to more concise numeration of corners in maps, e.g., odd or even corners allow
easy to follow distinguished cycles in map caused by the fixation of the knot.
Knot's normalization may be applied to edge structuring knot too. If both are
normalized then one is fully and other partially normalized mutually.
Category: Combinatorics and Graph Theory
[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.
Category: Combinatorics and Graph Theory
[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.
Category: Combinatorics and Graph Theory
[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.
Category: Combinatorics and Graph Theory
[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.
Category: Combinatorics and Graph Theory
[5] viXra:1003.0223 [pdf] submitted on 7 Mar 2010
Authors: Linfan Mao
Comments: 215 pages
SMARANDACHE GEOMETRIES
&
MAP THEORY WITH APPLICATIONS
Category: Combinatorics and Graph Theory
[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
Category: Combinatorics and Graph Theory
[3] viXra:1001.0030 [pdf] submitted on 22 Jan 2010
Authors: Dainis Zeps
Comments: 61 pages
Tutorial
Category: Combinatorics and Graph Theory
[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.
Category: Combinatorics and Graph Theory
[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.
Category: Combinatorics and Graph Theory
[2] viXra:1003.0227 [pdf] replaced on 26 Jun 2011
Authors: Linfan Mao
Comments: 399 pages.
Automorphism groups survey similarities on mathematical systems, which appear nearly
in all mathematical branches, such as those of algebra, combinatorics, geometry, ... and
theoretical physics, theoretical chemistry, etc. In geometry, configurations with high
symmetry born symmetrical patterns, a kind of beautiful pictures in aesthetics. Naturally,
automorphism groups enable one to distinguish systems by similarity. More automorphisms
imply more symmetries of that system. This fact has established the fundamental
role of automorphism groups in modern sciences. So it is important for graduate students
knowing automorphism groups with applications.
Category: Combinatorics and Graph Theory
[1] viXra:1003.0221 [pdf] replaced on 27 Jun 2011
Authors: Linfan Mao
Comments: 502 pages.
Accompanied with humanity into the 21st century, a highlight trend for developing
a science is its overlap and hybrid, and harmoniously with other sciences, which
enables one to handle complex systems in the WORLD. This is also for developing
mathematics. As a powerful tool for dealing with relations among objectives,
combinatorics, including combinatorial theory and graph theory mushroomed in last
century. Its related with algebra, probability theory and geometry has made it to an
important subject in mathematics and interesting results emerged in large number
without metrics. Today, the time is come for applying combinatorial technique to
other mathematics and other sciences besides just to find combinatorial behavior
for objectives. That is the motivation of this book, i.e., to survey mathematics and
fields by combinatorial principle.
Category: Combinatorics and Graph Theory