Contributions to Seymour's Second Neighborhood Conjecture
| dc.creator | Brantner, James N. | |
| dc.creator | Brockman, Greg | |
| dc.creator | Kay, Bill | |
| dc.creator | Snively, Emma E. | |
| dc.date | 2008-08-07 | |
| dc.date | 2008-08-19 | |
| dc.date.accessioned | 2026-07-07T09:57:00Z | |
| dc.date.available | 2026-07-07T09:57:00Z | |
| dc.description | Let D be a simple digraph without loops or digons. For any v in V(D) let N_1(v) be the set of all nodes at out-distance 1 from v and let N_2(v) be the set of all nodes at out-distance 2. We provide sufficient conditions under which there must exist some v in V(D) such that |N_1(v)| is less than or equal to |N_2(v)|, as well as examine properties of a minimal graph which does not have such a node. We show that if one such graph exists, then there exist infinitely many strongly-connected graphs having no such vertex. | |
| dc.description | 9 pages, 4 figures | |
| dc.identifier | https://arxiv.org/abs/0808.0946 | |
| dc.identifier | http://arxiv.org/abs/0808.0946 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/167186 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C20 | |
| dc.title | Contributions to Seymour's Second Neighborhood Conjecture | |
| dc.type | text |