| LDR | | 02041nam u200397 4500 |
| 001 | | 000000420075 |
| 005 | | 20190215164202 |
| 008 | | 181129s2018 |||||||||||||||||c||eng d |
| 020 | |
▼a 9780438296947 |
| 035 | |
▼a (MiAaPQ)AAI10827016 |
| 035 | |
▼a (MiAaPQ)uci:15132 |
| 040 | |
▼a MiAaPQ
▼c MiAaPQ
▼d 247004 |
| 082 | 0 |
▼a 510 |
| 100 | 1 |
▼a Porter, Michael B. |
| 245 | 10 |
▼a Extended Wenger Graphs. |
| 260 | |
▼a [S.l.]:
▼b University of California, Irvine.,
▼c 2018. |
| 260 | 1 |
▼a Ann Arbor:
▼b ProQuest Dissertations & Theses,
▼c 2018. |
| 300 | |
▼a 88 p. |
| 500 | |
▼a Source: Dissertation Abstracts International, Volume: 80-01(E), Section: B. |
| 500 | |
▼a Adviser: Daqing Wan. |
| 502 | 1 |
▼a Thesis (Ph.D.)--University of California, Irvine, 2018. |
| 520 | |
▼a Wenger graphs were originally introduced as examples of dense graphs that do not have cycles of a given size. Graphs with similar properties were known at the time, but Wenger graphs are based on algebraic relations in finite fields, and as such |
| 520 | |
▼a Wenger graphs are bipartite, with the vertices consisting of two copies of the vector space of dimension m+1 over the finite field of order q. These two sets of vertices are called points and lines, with a point vertex connected to a line vertex |
| 520 | |
▼a Since their introduction in 1991, the original Wenger graph concept has been extended to include linearized and jumped Wenger graphs, and some results are known for extensions in general. In this dissertation, another extension, the extended Wen |
| 590 | |
▼a School code: 0030. |
| 650 | 4 |
▼a Mathematics. |
| 690 | |
▼a 0405 |
| 710 | 20 |
▼a University of California, Irvine.
▼b Mathematics - Ph.D.. |
| 773 | 0 |
▼t Dissertation Abstracts International
▼g 80-01B(E). |
| 773 | |
▼t Dissertation Abstract International |
| 790 | |
▼a 0030 |
| 791 | |
▼a Ph.D. |
| 792 | |
▼a 2018 |
| 793 | |
▼a English |
| 856 | 40 |
▼u http://www.riss.kr/pdu/ddodLink.do?id=T14998968
▼n KERIS
▼z 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |
| 980 | |
▼a 201812
▼f 2019 |
| 990 | |
▼a ***1012033 |