Nonstandard Digraphs
| dc.creator | Zemanian, A. H. | |
| dc.date | 2009-04-27 | |
| dc.date.accessioned | 2026-07-07T13:08:58Z | |
| dc.date.available | 2026-07-07T13:08:58Z | |
| dc.description | Nonstandard graphs have been defined and examined in prior works. The present work does the same for nonstandard digraphs. Since digraphs have more structure than do graphs, the present discussion requires more complicated definitions and yields a variety of results peculiar to nonstandard digraphs. A nonstandard digraph can be obtained by means of an ultrapower construction based on a sequence of digraphs or more elegantly by using the transfer principle. We use either or both techniques in particular circumstances. As special cases, we have the enlargement of a single infinite digraph and also hyperfinite digraphs based on sequences of finite digraphs. Also examined are such ideas as incidences and adjacencies for nonstandard arcs and vertices, connectedness, components, and galaxies in nonstandard digraphs. | |
| dc.description | 15 pages | |
| dc.identifier | https://arxiv.org/abs/0904.4161 | |
| dc.identifier | http://arxiv.org/abs/0904.4161 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/228591 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C99 | |
| dc.title | Nonstandard Digraphs | |
| dc.type | text |