Nonstandard Graphs, Revised
| dc.creator | Zemanian, A. H. | |
| dc.date | 2003-04-07 | |
| dc.date.accessioned | 2026-07-07T04:56:41Z | |
| dc.date.available | 2026-07-07T04:56:41Z | |
| dc.description | This is a revision of the paper archived previously on August 22, 2002. It corrects a mistake in Sec. 8 concerning eccentricities of graphs. From any given sequence of finite or infinite graphs, a nonstandard graph is constructed. The procedure is similar to an ultrapower construction on 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 and edges 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. Key Words: Nonstandard graphs, transfer principle, ultrapower constructions. | |
| dc.identifier | https://arxiv.org/abs/math/0304093 | |
| dc.identifier | http://arxiv.org/abs/math/0304093 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/67011 | |
| dc.subject | Combinatorics | |
| dc.title | Nonstandard Graphs, Revised | |
| dc.type | text |