Tetravalent half-arc-transitive graphs of order 2pq
Abstract A graph is half-arc-transitive if its automorphism group acts transitively on its vertex set, edge set, but not arc set. Let p and q be primes. It is known that no tetravalent half-arc-transitive graphs of order 2p2 exist and a tetravalent half-arc-transitive graph of order 4p must be non-C...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Feng, Yan-Quan [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2010 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media, LLC 2010 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Journal of algebraic combinatorics - Springer US, 1992, 33(2010), 4 vom: 21. Okt., Seite 543-553 |
|---|---|
| Übergeordnetes Werk: |
volume:33 ; year:2010 ; number:4 ; day:21 ; month:10 ; pages:543-553 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10801-010-0257-1 |
|---|
| Katalog-ID: |
OLC2034248473 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2034248473 | ||
| 003 | DE-627 | ||
| 005 | 20230503102919.0 | ||
| 007 | tu | ||
| 008 | 200819s2010 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10801-010-0257-1 |2 doi | |
| 035 | |a (DE-627)OLC2034248473 | ||
| 035 | |a (DE-He213)s10801-010-0257-1-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 510 |q VZ |
| 084 | |a 17,1 |2 ssgn | ||
| 100 | 1 | |a Feng, Yan-Quan |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Tetravalent half-arc-transitive graphs of order 2pq |
| 264 | 1 | |c 2010 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science+Business Media, LLC 2010 | ||
| 520 | |a Abstract A graph is half-arc-transitive if its automorphism group acts transitively on its vertex set, edge set, but not arc set. Let p and q be primes. It is known that no tetravalent half-arc-transitive graphs of order 2p2 exist and a tetravalent half-arc-transitive graph of order 4p must be non-Cayley; such a non-Cayley graph exists if and only if p−1 is divisible by 8 and it is unique for a given order. Based on the constructions of tetravalent half-arc-transitive graphs given by Marušič (J. Comb. Theory B 73:41–76, 1998), in this paper the connected tetravalent half-arc-transitive graphs of order 2pq are classified for distinct odd primes p and q. | ||
| 650 | 4 | |a Cayley graph | |
| 650 | 4 | |a Vertex-transitive graph | |
| 650 | 4 | |a Half-arc-transitive graph | |
| 700 | 1 | |a Kwak, Jin Ho |4 aut | |
| 700 | 1 | |a Wang, Xiuyun |4 aut | |
| 700 | 1 | |a Zhou, Jin-Xin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Journal of algebraic combinatorics |d Springer US, 1992 |g 33(2010), 4 vom: 21. Okt., Seite 543-553 |w (DE-627)131180770 |w (DE-600)1143271-8 |w (DE-576)033043701 |x 0925-9899 |7 nnns |
| 773 | 1 | 8 | |g volume:33 |g year:2010 |g number:4 |g day:21 |g month:10 |g pages:543-553 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10801-010-0257-1 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a GBV_ILN_24 | ||
| 912 | |a GBV_ILN_40 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_100 | ||
| 912 | |a GBV_ILN_2002 | ||
| 912 | |a GBV_ILN_2088 | ||
| 912 | |a GBV_ILN_4323 | ||
| 951 | |a AR | ||
| 952 | |d 33 |j 2010 |e 4 |b 21 |c 10 |h 543-553 | ||
| author_variant |
y q f yqf j h k jh jhk x w xw j x z jxz |
|---|---|
| matchkey_str |
article:09259899:2010----::ervlnhlacrniierp |
| hierarchy_sort_str |
2010 |
| publishDate |
2010 |
| allfields |
10.1007/s10801-010-0257-1 doi (DE-627)OLC2034248473 (DE-He213)s10801-010-0257-1-p DE-627 ger DE-627 rakwb eng 510 VZ 17,1 ssgn Feng, Yan-Quan verfasserin aut Tetravalent half-arc-transitive graphs of order 2pq 2010 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2010 Abstract A graph is half-arc-transitive if its automorphism group acts transitively on its vertex set, edge set, but not arc set. Let p and q be primes. It is known that no tetravalent half-arc-transitive graphs of order 2p2 exist and a tetravalent half-arc-transitive graph of order 4p must be non-Cayley; such a non-Cayley graph exists if and only if p−1 is divisible by 8 and it is unique for a given order. Based on the constructions of tetravalent half-arc-transitive graphs given by Marušič (J. Comb. Theory B 73:41–76, 1998), in this paper the connected tetravalent half-arc-transitive graphs of order 2pq are classified for distinct odd primes p and q. Cayley graph Vertex-transitive graph Half-arc-transitive graph Kwak, Jin Ho aut Wang, Xiuyun aut Zhou, Jin-Xin aut Enthalten in Journal of algebraic combinatorics Springer US, 1992 33(2010), 4 vom: 21. Okt., Seite 543-553 (DE-627)131180770 (DE-600)1143271-8 (DE-576)033043701 0925-9899 nnns volume:33 year:2010 number:4 day:21 month:10 pages:543-553 https://doi.org/10.1007/s10801-010-0257-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_24 GBV_ILN_40 GBV_ILN_70 GBV_ILN_100 GBV_ILN_2002 GBV_ILN_2088 GBV_ILN_4323 AR 33 2010 4 21 10 543-553 |
| spelling |
10.1007/s10801-010-0257-1 doi (DE-627)OLC2034248473 (DE-He213)s10801-010-0257-1-p DE-627 ger DE-627 rakwb eng 510 VZ 17,1 ssgn Feng, Yan-Quan verfasserin aut Tetravalent half-arc-transitive graphs of order 2pq 2010 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2010 Abstract A graph is half-arc-transitive if its automorphism group acts transitively on its vertex set, edge set, but not arc set. Let p and q be primes. It is known that no tetravalent half-arc-transitive graphs of order 2p2 exist and a tetravalent half-arc-transitive graph of order 4p must be non-Cayley; such a non-Cayley graph exists if and only if p−1 is divisible by 8 and it is unique for a given order. Based on the constructions of tetravalent half-arc-transitive graphs given by Marušič (J. Comb. Theory B 73:41–76, 1998), in this paper the connected tetravalent half-arc-transitive graphs of order 2pq are classified for distinct odd primes p and q. Cayley graph Vertex-transitive graph Half-arc-transitive graph Kwak, Jin Ho aut Wang, Xiuyun aut Zhou, Jin-Xin aut Enthalten in Journal of algebraic combinatorics Springer US, 1992 33(2010), 4 vom: 21. Okt., Seite 543-553 (DE-627)131180770 (DE-600)1143271-8 (DE-576)033043701 0925-9899 nnns volume:33 year:2010 number:4 day:21 month:10 pages:543-553 https://doi.org/10.1007/s10801-010-0257-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_24 GBV_ILN_40 GBV_ILN_70 GBV_ILN_100 GBV_ILN_2002 GBV_ILN_2088 GBV_ILN_4323 AR 33 2010 4 21 10 543-553 |
| allfields_unstemmed |
10.1007/s10801-010-0257-1 doi (DE-627)OLC2034248473 (DE-He213)s10801-010-0257-1-p DE-627 ger DE-627 rakwb eng 510 VZ 17,1 ssgn Feng, Yan-Quan verfasserin aut Tetravalent half-arc-transitive graphs of order 2pq 2010 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2010 Abstract A graph is half-arc-transitive if its automorphism group acts transitively on its vertex set, edge set, but not arc set. Let p and q be primes. It is known that no tetravalent half-arc-transitive graphs of order 2p2 exist and a tetravalent half-arc-transitive graph of order 4p must be non-Cayley; such a non-Cayley graph exists if and only if p−1 is divisible by 8 and it is unique for a given order. Based on the constructions of tetravalent half-arc-transitive graphs given by Marušič (J. Comb. Theory B 73:41–76, 1998), in this paper the connected tetravalent half-arc-transitive graphs of order 2pq are classified for distinct odd primes p and q. Cayley graph Vertex-transitive graph Half-arc-transitive graph Kwak, Jin Ho aut Wang, Xiuyun aut Zhou, Jin-Xin aut Enthalten in Journal of algebraic combinatorics Springer US, 1992 33(2010), 4 vom: 21. Okt., Seite 543-553 (DE-627)131180770 (DE-600)1143271-8 (DE-576)033043701 0925-9899 nnns volume:33 year:2010 number:4 day:21 month:10 pages:543-553 https://doi.org/10.1007/s10801-010-0257-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_24 GBV_ILN_40 GBV_ILN_70 GBV_ILN_100 GBV_ILN_2002 GBV_ILN_2088 GBV_ILN_4323 AR 33 2010 4 21 10 543-553 |
| allfieldsGer |
10.1007/s10801-010-0257-1 doi (DE-627)OLC2034248473 (DE-He213)s10801-010-0257-1-p DE-627 ger DE-627 rakwb eng 510 VZ 17,1 ssgn Feng, Yan-Quan verfasserin aut Tetravalent half-arc-transitive graphs of order 2pq 2010 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2010 Abstract A graph is half-arc-transitive if its automorphism group acts transitively on its vertex set, edge set, but not arc set. Let p and q be primes. It is known that no tetravalent half-arc-transitive graphs of order 2p2 exist and a tetravalent half-arc-transitive graph of order 4p must be non-Cayley; such a non-Cayley graph exists if and only if p−1 is divisible by 8 and it is unique for a given order. Based on the constructions of tetravalent half-arc-transitive graphs given by Marušič (J. Comb. Theory B 73:41–76, 1998), in this paper the connected tetravalent half-arc-transitive graphs of order 2pq are classified for distinct odd primes p and q. Cayley graph Vertex-transitive graph Half-arc-transitive graph Kwak, Jin Ho aut Wang, Xiuyun aut Zhou, Jin-Xin aut Enthalten in Journal of algebraic combinatorics Springer US, 1992 33(2010), 4 vom: 21. Okt., Seite 543-553 (DE-627)131180770 (DE-600)1143271-8 (DE-576)033043701 0925-9899 nnns volume:33 year:2010 number:4 day:21 month:10 pages:543-553 https://doi.org/10.1007/s10801-010-0257-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_24 GBV_ILN_40 GBV_ILN_70 GBV_ILN_100 GBV_ILN_2002 GBV_ILN_2088 GBV_ILN_4323 AR 33 2010 4 21 10 543-553 |
| allfieldsSound |
10.1007/s10801-010-0257-1 doi (DE-627)OLC2034248473 (DE-He213)s10801-010-0257-1-p DE-627 ger DE-627 rakwb eng 510 VZ 17,1 ssgn Feng, Yan-Quan verfasserin aut Tetravalent half-arc-transitive graphs of order 2pq 2010 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2010 Abstract A graph is half-arc-transitive if its automorphism group acts transitively on its vertex set, edge set, but not arc set. Let p and q be primes. It is known that no tetravalent half-arc-transitive graphs of order 2p2 exist and a tetravalent half-arc-transitive graph of order 4p must be non-Cayley; such a non-Cayley graph exists if and only if p−1 is divisible by 8 and it is unique for a given order. Based on the constructions of tetravalent half-arc-transitive graphs given by Marušič (J. Comb. Theory B 73:41–76, 1998), in this paper the connected tetravalent half-arc-transitive graphs of order 2pq are classified for distinct odd primes p and q. Cayley graph Vertex-transitive graph Half-arc-transitive graph Kwak, Jin Ho aut Wang, Xiuyun aut Zhou, Jin-Xin aut Enthalten in Journal of algebraic combinatorics Springer US, 1992 33(2010), 4 vom: 21. Okt., Seite 543-553 (DE-627)131180770 (DE-600)1143271-8 (DE-576)033043701 0925-9899 nnns volume:33 year:2010 number:4 day:21 month:10 pages:543-553 https://doi.org/10.1007/s10801-010-0257-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_24 GBV_ILN_40 GBV_ILN_70 GBV_ILN_100 GBV_ILN_2002 GBV_ILN_2088 GBV_ILN_4323 AR 33 2010 4 21 10 543-553 |
| language |
English |
| source |
Enthalten in Journal of algebraic combinatorics 33(2010), 4 vom: 21. Okt., Seite 543-553 volume:33 year:2010 number:4 day:21 month:10 pages:543-553 |
| sourceStr |
Enthalten in Journal of algebraic combinatorics 33(2010), 4 vom: 21. Okt., Seite 543-553 volume:33 year:2010 number:4 day:21 month:10 pages:543-553 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Cayley graph Vertex-transitive graph Half-arc-transitive graph |
| dewey-raw |
510 |
| isfreeaccess_bool |
false |
| container_title |
Journal of algebraic combinatorics |
| authorswithroles_txt_mv |
Feng, Yan-Quan @@aut@@ Kwak, Jin Ho @@aut@@ Wang, Xiuyun @@aut@@ Zhou, Jin-Xin @@aut@@ |
| publishDateDaySort_date |
2010-10-21T00:00:00Z |
| hierarchy_top_id |
131180770 |
| dewey-sort |
3510 |
| id |
OLC2034248473 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2034248473</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503102919.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2010 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10801-010-0257-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2034248473</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10801-010-0257-1-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">17,1</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Feng, Yan-Quan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Tetravalent half-arc-transitive graphs of order 2pq</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2010</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC 2010</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract A graph is half-arc-transitive if its automorphism group acts transitively on its vertex set, edge set, but not arc set. Let p and q be primes. It is known that no tetravalent half-arc-transitive graphs of order 2p2 exist and a tetravalent half-arc-transitive graph of order 4p must be non-Cayley; such a non-Cayley graph exists if and only if p−1 is divisible by 8 and it is unique for a given order. Based on the constructions of tetravalent half-arc-transitive graphs given by Marušič (J. Comb. Theory B 73:41–76, 1998), in this paper the connected tetravalent half-arc-transitive graphs of order 2pq are classified for distinct odd primes p and q.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cayley graph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Vertex-transitive graph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Half-arc-transitive graph</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kwak, Jin Ho</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Xiuyun</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhou, Jin-Xin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of algebraic combinatorics</subfield><subfield code="d">Springer US, 1992</subfield><subfield code="g">33(2010), 4 vom: 21. Okt., Seite 543-553</subfield><subfield code="w">(DE-627)131180770</subfield><subfield code="w">(DE-600)1143271-8</subfield><subfield code="w">(DE-576)033043701</subfield><subfield code="x">0925-9899</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:33</subfield><subfield code="g">year:2010</subfield><subfield code="g">number:4</subfield><subfield code="g">day:21</subfield><subfield code="g">month:10</subfield><subfield code="g">pages:543-553</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10801-010-0257-1</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2002</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">33</subfield><subfield code="j">2010</subfield><subfield code="e">4</subfield><subfield code="b">21</subfield><subfield code="c">10</subfield><subfield code="h">543-553</subfield></datafield></record></collection>
|
| author |
Feng, Yan-Quan |
| spellingShingle |
Feng, Yan-Quan ddc 510 ssgn 17,1 misc Cayley graph misc Vertex-transitive graph misc Half-arc-transitive graph Tetravalent half-arc-transitive graphs of order 2pq |
| authorStr |
Feng, Yan-Quan |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)131180770 |
| format |
Article |
| dewey-ones |
510 - Mathematics |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0925-9899 |
| topic_title |
510 VZ 17,1 ssgn Tetravalent half-arc-transitive graphs of order 2pq Cayley graph Vertex-transitive graph Half-arc-transitive graph |
| topic |
ddc 510 ssgn 17,1 misc Cayley graph misc Vertex-transitive graph misc Half-arc-transitive graph |
| topic_unstemmed |
ddc 510 ssgn 17,1 misc Cayley graph misc Vertex-transitive graph misc Half-arc-transitive graph |
| topic_browse |
ddc 510 ssgn 17,1 misc Cayley graph misc Vertex-transitive graph misc Half-arc-transitive graph |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Journal of algebraic combinatorics |
| hierarchy_parent_id |
131180770 |
| dewey-tens |
510 - Mathematics |
| hierarchy_top_title |
Journal of algebraic combinatorics |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)131180770 (DE-600)1143271-8 (DE-576)033043701 |
| title |
Tetravalent half-arc-transitive graphs of order 2pq |
| ctrlnum |
(DE-627)OLC2034248473 (DE-He213)s10801-010-0257-1-p |
| title_full |
Tetravalent half-arc-transitive graphs of order 2pq |
| author_sort |
Feng, Yan-Quan |
| journal |
Journal of algebraic combinatorics |
| journalStr |
Journal of algebraic combinatorics |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
500 - Science |
| recordtype |
marc |
| publishDateSort |
2010 |
| contenttype_str_mv |
txt |
| container_start_page |
543 |
| author_browse |
Feng, Yan-Quan Kwak, Jin Ho Wang, Xiuyun Zhou, Jin-Xin |
| container_volume |
33 |
| class |
510 VZ 17,1 ssgn |
| format_se |
Aufsätze |
| author-letter |
Feng, Yan-Quan |
| doi_str_mv |
10.1007/s10801-010-0257-1 |
| dewey-full |
510 |
| title_sort |
tetravalent half-arc-transitive graphs of order 2pq |
| title_auth |
Tetravalent half-arc-transitive graphs of order 2pq |
| abstract |
Abstract A graph is half-arc-transitive if its automorphism group acts transitively on its vertex set, edge set, but not arc set. Let p and q be primes. It is known that no tetravalent half-arc-transitive graphs of order 2p2 exist and a tetravalent half-arc-transitive graph of order 4p must be non-Cayley; such a non-Cayley graph exists if and only if p−1 is divisible by 8 and it is unique for a given order. Based on the constructions of tetravalent half-arc-transitive graphs given by Marušič (J. Comb. Theory B 73:41–76, 1998), in this paper the connected tetravalent half-arc-transitive graphs of order 2pq are classified for distinct odd primes p and q. © Springer Science+Business Media, LLC 2010 |
| abstractGer |
Abstract A graph is half-arc-transitive if its automorphism group acts transitively on its vertex set, edge set, but not arc set. Let p and q be primes. It is known that no tetravalent half-arc-transitive graphs of order 2p2 exist and a tetravalent half-arc-transitive graph of order 4p must be non-Cayley; such a non-Cayley graph exists if and only if p−1 is divisible by 8 and it is unique for a given order. Based on the constructions of tetravalent half-arc-transitive graphs given by Marušič (J. Comb. Theory B 73:41–76, 1998), in this paper the connected tetravalent half-arc-transitive graphs of order 2pq are classified for distinct odd primes p and q. © Springer Science+Business Media, LLC 2010 |
| abstract_unstemmed |
Abstract A graph is half-arc-transitive if its automorphism group acts transitively on its vertex set, edge set, but not arc set. Let p and q be primes. It is known that no tetravalent half-arc-transitive graphs of order 2p2 exist and a tetravalent half-arc-transitive graph of order 4p must be non-Cayley; such a non-Cayley graph exists if and only if p−1 is divisible by 8 and it is unique for a given order. Based on the constructions of tetravalent half-arc-transitive graphs given by Marušič (J. Comb. Theory B 73:41–76, 1998), in this paper the connected tetravalent half-arc-transitive graphs of order 2pq are classified for distinct odd primes p and q. © Springer Science+Business Media, LLC 2010 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_24 GBV_ILN_40 GBV_ILN_70 GBV_ILN_100 GBV_ILN_2002 GBV_ILN_2088 GBV_ILN_4323 |
| container_issue |
4 |
| title_short |
Tetravalent half-arc-transitive graphs of order 2pq |
| url |
https://doi.org/10.1007/s10801-010-0257-1 |
| remote_bool |
false |
| author2 |
Kwak, Jin Ho Wang, Xiuyun Zhou, Jin-Xin |
| author2Str |
Kwak, Jin Ho Wang, Xiuyun Zhou, Jin-Xin |
| ppnlink |
131180770 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10801-010-0257-1 |
| up_date |
2024-07-03T20:15:04.845Z |
| _version_ |
1803590256396599296 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2034248473</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503102919.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2010 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10801-010-0257-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2034248473</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10801-010-0257-1-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">17,1</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Feng, Yan-Quan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Tetravalent half-arc-transitive graphs of order 2pq</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2010</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC 2010</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract A graph is half-arc-transitive if its automorphism group acts transitively on its vertex set, edge set, but not arc set. Let p and q be primes. It is known that no tetravalent half-arc-transitive graphs of order 2p2 exist and a tetravalent half-arc-transitive graph of order 4p must be non-Cayley; such a non-Cayley graph exists if and only if p−1 is divisible by 8 and it is unique for a given order. Based on the constructions of tetravalent half-arc-transitive graphs given by Marušič (J. Comb. Theory B 73:41–76, 1998), in this paper the connected tetravalent half-arc-transitive graphs of order 2pq are classified for distinct odd primes p and q.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cayley graph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Vertex-transitive graph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Half-arc-transitive graph</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kwak, Jin Ho</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Xiuyun</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhou, Jin-Xin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of algebraic combinatorics</subfield><subfield code="d">Springer US, 1992</subfield><subfield code="g">33(2010), 4 vom: 21. Okt., Seite 543-553</subfield><subfield code="w">(DE-627)131180770</subfield><subfield code="w">(DE-600)1143271-8</subfield><subfield code="w">(DE-576)033043701</subfield><subfield code="x">0925-9899</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:33</subfield><subfield code="g">year:2010</subfield><subfield code="g">number:4</subfield><subfield code="g">day:21</subfield><subfield code="g">month:10</subfield><subfield code="g">pages:543-553</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10801-010-0257-1</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2002</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">33</subfield><subfield code="j">2010</subfield><subfield code="e">4</subfield><subfield code="b">21</subfield><subfield code="c">10</subfield><subfield code="h">543-553</subfield></datafield></record></collection>
|
| score |
7.400218 |