Nonstandard Graphs

Details Nonstandard Graphs Nonstandard Graphs

2002-08-22

arxiv.org/abs/math/0208165v1

Mathematics

Combinatorics

Scientific paper

From any given sequence of finite or infinite graphs, a nonstandard graph is constructed. The procedure is similar to an ultrapower construction of an internal set from a sequence of subsets of the real line, but now the individual entities are the vertices of the graphs instead of real numbers. The transfer principle is then invoked to extend several graph-theoretic results to the nonstandard case. After incidences and adjacencies between nonstandard vertices are defined, several formulas regarding numbers of vertices and edges, and nonstandard versions of Eulerian graphs, Hamiltonian graphs, and a coloring theorem are established for these nonstandard graphs.

Affiliated with

Also associated with

No associations

Rating

Nonstandard Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Nonstandard Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nonstandard Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-402344