On groups all of whose Haar graphs are Cayley graphs
Abstract A Cayley graph of a group H is a finite simple graph $$\Gamma $$ such that $$\mathrm{Aut}(\Gamma )$$ contains a subgroup isomorphic to H acting regularly on $$V(\Gamma ),$$ while a Haar graph of H is a finite simple bipartite graph $$\Sigma $$ such that $$\mathrm{Aut}(\Sigma )$$ contains a...
Ausführliche Beschreibung
Autor*in: |
Feng, Yan-Quan [verfasserIn] |
---|
Format: |
Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2019 |
---|
Schlagwörter: |
---|
Anmerkung: |
© Springer Science+Business Media, LLC, part of Springer Nature 2019 |
---|
Übergeordnetes Werk: |
Enthalten in: Journal of algebraic combinatorics - Springer US, 1992, 52(2019), 1 vom: 10. Juni, Seite 59-76 |
---|---|
Übergeordnetes Werk: |
volume:52 ; year:2019 ; number:1 ; day:10 ; month:06 ; pages:59-76 |
Links: |
---|
DOI / URN: |
10.1007/s10801-019-00894-7 |
---|
Katalog-ID: |
OLC2077611650 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | OLC2077611650 | ||
003 | DE-627 | ||
005 | 20230505153711.0 | ||
007 | tu | ||
008 | 221220s2019 xx ||||| 00| ||eng c | ||
024 | 7 | |a 10.1007/s10801-019-00894-7 |2 doi | |
035 | |a (DE-627)OLC2077611650 | ||
035 | |a (DE-He213)s10801-019-00894-7-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 On groups all of whose Haar graphs are Cayley graphs |
264 | 1 | |c 2019 | |
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, part of Springer Nature 2019 | ||
520 | |a Abstract A Cayley graph of a group H is a finite simple graph $$\Gamma $$ such that $$\mathrm{Aut}(\Gamma )$$ contains a subgroup isomorphic to H acting regularly on $$V(\Gamma ),$$ while a Haar graph of H is a finite simple bipartite graph $$\Sigma $$ such that $$\mathrm{Aut}(\Sigma )$$ contains a subgroup isomorphic to H acting semiregularly on $$V(\Sigma )$$ and the H-orbits are equal to the bipartite sets of $$\Sigma $$. A Cayley graph is a Haar graph exactly when it is bipartite, but no simple condition is known for a Haar graph to be a Cayley graph. In this paper, we show that $$D_6, \, D_8, \, D_{10}$$ and $$Q_8$$ are the only finite inner abelian groups all of whose Haar graphs are Cayley graphs. (A group is called inner abelian if it is non-abelian, but all of its proper subgroups are abelian.) This result will then be used to derive that every non-solvable group admits a non-Cayley Haar graph. | ||
650 | 4 | |a Haar graph | |
650 | 4 | |a Cayley graph | |
650 | 4 | |a Vertex-transitive graph | |
700 | 1 | |a Kovács, István |4 aut | |
700 | 1 | |a Yang, Da-Wei |4 aut | |
773 | 0 | 8 | |i Enthalten in |t Journal of algebraic combinatorics |d Springer US, 1992 |g 52(2019), 1 vom: 10. Juni, Seite 59-76 |w (DE-627)131180770 |w (DE-600)1143271-8 |w (DE-576)033043701 |x 0925-9899 |7 nnns |
773 | 1 | 8 | |g volume:52 |g year:2019 |g number:1 |g day:10 |g month:06 |g pages:59-76 |
856 | 4 | 1 | |u https://doi.org/10.1007/s10801-019-00894-7 |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_70 | ||
951 | |a AR | ||
952 | |d 52 |j 2019 |e 1 |b 10 |c 06 |h 59-76 |
author_variant |
y q f yqf i k ik d w y dwy |
---|---|
matchkey_str |
article:09259899:2019----::nruslowoearrpsr |
hierarchy_sort_str |
2019 |
publishDate |
2019 |
allfields |
10.1007/s10801-019-00894-7 doi (DE-627)OLC2077611650 (DE-He213)s10801-019-00894-7-p DE-627 ger DE-627 rakwb eng 510 VZ 17,1 ssgn Feng, Yan-Quan verfasserin aut On groups all of whose Haar graphs are Cayley graphs 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2019 Abstract A Cayley graph of a group H is a finite simple graph $$\Gamma $$ such that $$\mathrm{Aut}(\Gamma )$$ contains a subgroup isomorphic to H acting regularly on $$V(\Gamma ),$$ while a Haar graph of H is a finite simple bipartite graph $$\Sigma $$ such that $$\mathrm{Aut}(\Sigma )$$ contains a subgroup isomorphic to H acting semiregularly on $$V(\Sigma )$$ and the H-orbits are equal to the bipartite sets of $$\Sigma $$. A Cayley graph is a Haar graph exactly when it is bipartite, but no simple condition is known for a Haar graph to be a Cayley graph. In this paper, we show that $$D_6, \, D_8, \, D_{10}$$ and $$Q_8$$ are the only finite inner abelian groups all of whose Haar graphs are Cayley graphs. (A group is called inner abelian if it is non-abelian, but all of its proper subgroups are abelian.) This result will then be used to derive that every non-solvable group admits a non-Cayley Haar graph. Haar graph Cayley graph Vertex-transitive graph Kovács, István aut Yang, Da-Wei aut Enthalten in Journal of algebraic combinatorics Springer US, 1992 52(2019), 1 vom: 10. Juni, Seite 59-76 (DE-627)131180770 (DE-600)1143271-8 (DE-576)033043701 0925-9899 nnns volume:52 year:2019 number:1 day:10 month:06 pages:59-76 https://doi.org/10.1007/s10801-019-00894-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 AR 52 2019 1 10 06 59-76 |
spelling |
10.1007/s10801-019-00894-7 doi (DE-627)OLC2077611650 (DE-He213)s10801-019-00894-7-p DE-627 ger DE-627 rakwb eng 510 VZ 17,1 ssgn Feng, Yan-Quan verfasserin aut On groups all of whose Haar graphs are Cayley graphs 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2019 Abstract A Cayley graph of a group H is a finite simple graph $$\Gamma $$ such that $$\mathrm{Aut}(\Gamma )$$ contains a subgroup isomorphic to H acting regularly on $$V(\Gamma ),$$ while a Haar graph of H is a finite simple bipartite graph $$\Sigma $$ such that $$\mathrm{Aut}(\Sigma )$$ contains a subgroup isomorphic to H acting semiregularly on $$V(\Sigma )$$ and the H-orbits are equal to the bipartite sets of $$\Sigma $$. A Cayley graph is a Haar graph exactly when it is bipartite, but no simple condition is known for a Haar graph to be a Cayley graph. In this paper, we show that $$D_6, \, D_8, \, D_{10}$$ and $$Q_8$$ are the only finite inner abelian groups all of whose Haar graphs are Cayley graphs. (A group is called inner abelian if it is non-abelian, but all of its proper subgroups are abelian.) This result will then be used to derive that every non-solvable group admits a non-Cayley Haar graph. Haar graph Cayley graph Vertex-transitive graph Kovács, István aut Yang, Da-Wei aut Enthalten in Journal of algebraic combinatorics Springer US, 1992 52(2019), 1 vom: 10. Juni, Seite 59-76 (DE-627)131180770 (DE-600)1143271-8 (DE-576)033043701 0925-9899 nnns volume:52 year:2019 number:1 day:10 month:06 pages:59-76 https://doi.org/10.1007/s10801-019-00894-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 AR 52 2019 1 10 06 59-76 |
allfields_unstemmed |
10.1007/s10801-019-00894-7 doi (DE-627)OLC2077611650 (DE-He213)s10801-019-00894-7-p DE-627 ger DE-627 rakwb eng 510 VZ 17,1 ssgn Feng, Yan-Quan verfasserin aut On groups all of whose Haar graphs are Cayley graphs 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2019 Abstract A Cayley graph of a group H is a finite simple graph $$\Gamma $$ such that $$\mathrm{Aut}(\Gamma )$$ contains a subgroup isomorphic to H acting regularly on $$V(\Gamma ),$$ while a Haar graph of H is a finite simple bipartite graph $$\Sigma $$ such that $$\mathrm{Aut}(\Sigma )$$ contains a subgroup isomorphic to H acting semiregularly on $$V(\Sigma )$$ and the H-orbits are equal to the bipartite sets of $$\Sigma $$. A Cayley graph is a Haar graph exactly when it is bipartite, but no simple condition is known for a Haar graph to be a Cayley graph. In this paper, we show that $$D_6, \, D_8, \, D_{10}$$ and $$Q_8$$ are the only finite inner abelian groups all of whose Haar graphs are Cayley graphs. (A group is called inner abelian if it is non-abelian, but all of its proper subgroups are abelian.) This result will then be used to derive that every non-solvable group admits a non-Cayley Haar graph. Haar graph Cayley graph Vertex-transitive graph Kovács, István aut Yang, Da-Wei aut Enthalten in Journal of algebraic combinatorics Springer US, 1992 52(2019), 1 vom: 10. Juni, Seite 59-76 (DE-627)131180770 (DE-600)1143271-8 (DE-576)033043701 0925-9899 nnns volume:52 year:2019 number:1 day:10 month:06 pages:59-76 https://doi.org/10.1007/s10801-019-00894-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 AR 52 2019 1 10 06 59-76 |
allfieldsGer |
10.1007/s10801-019-00894-7 doi (DE-627)OLC2077611650 (DE-He213)s10801-019-00894-7-p DE-627 ger DE-627 rakwb eng 510 VZ 17,1 ssgn Feng, Yan-Quan verfasserin aut On groups all of whose Haar graphs are Cayley graphs 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2019 Abstract A Cayley graph of a group H is a finite simple graph $$\Gamma $$ such that $$\mathrm{Aut}(\Gamma )$$ contains a subgroup isomorphic to H acting regularly on $$V(\Gamma ),$$ while a Haar graph of H is a finite simple bipartite graph $$\Sigma $$ such that $$\mathrm{Aut}(\Sigma )$$ contains a subgroup isomorphic to H acting semiregularly on $$V(\Sigma )$$ and the H-orbits are equal to the bipartite sets of $$\Sigma $$. A Cayley graph is a Haar graph exactly when it is bipartite, but no simple condition is known for a Haar graph to be a Cayley graph. In this paper, we show that $$D_6, \, D_8, \, D_{10}$$ and $$Q_8$$ are the only finite inner abelian groups all of whose Haar graphs are Cayley graphs. (A group is called inner abelian if it is non-abelian, but all of its proper subgroups are abelian.) This result will then be used to derive that every non-solvable group admits a non-Cayley Haar graph. Haar graph Cayley graph Vertex-transitive graph Kovács, István aut Yang, Da-Wei aut Enthalten in Journal of algebraic combinatorics Springer US, 1992 52(2019), 1 vom: 10. Juni, Seite 59-76 (DE-627)131180770 (DE-600)1143271-8 (DE-576)033043701 0925-9899 nnns volume:52 year:2019 number:1 day:10 month:06 pages:59-76 https://doi.org/10.1007/s10801-019-00894-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 AR 52 2019 1 10 06 59-76 |
allfieldsSound |
10.1007/s10801-019-00894-7 doi (DE-627)OLC2077611650 (DE-He213)s10801-019-00894-7-p DE-627 ger DE-627 rakwb eng 510 VZ 17,1 ssgn Feng, Yan-Quan verfasserin aut On groups all of whose Haar graphs are Cayley graphs 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2019 Abstract A Cayley graph of a group H is a finite simple graph $$\Gamma $$ such that $$\mathrm{Aut}(\Gamma )$$ contains a subgroup isomorphic to H acting regularly on $$V(\Gamma ),$$ while a Haar graph of H is a finite simple bipartite graph $$\Sigma $$ such that $$\mathrm{Aut}(\Sigma )$$ contains a subgroup isomorphic to H acting semiregularly on $$V(\Sigma )$$ and the H-orbits are equal to the bipartite sets of $$\Sigma $$. A Cayley graph is a Haar graph exactly when it is bipartite, but no simple condition is known for a Haar graph to be a Cayley graph. In this paper, we show that $$D_6, \, D_8, \, D_{10}$$ and $$Q_8$$ are the only finite inner abelian groups all of whose Haar graphs are Cayley graphs. (A group is called inner abelian if it is non-abelian, but all of its proper subgroups are abelian.) This result will then be used to derive that every non-solvable group admits a non-Cayley Haar graph. Haar graph Cayley graph Vertex-transitive graph Kovács, István aut Yang, Da-Wei aut Enthalten in Journal of algebraic combinatorics Springer US, 1992 52(2019), 1 vom: 10. Juni, Seite 59-76 (DE-627)131180770 (DE-600)1143271-8 (DE-576)033043701 0925-9899 nnns volume:52 year:2019 number:1 day:10 month:06 pages:59-76 https://doi.org/10.1007/s10801-019-00894-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 AR 52 2019 1 10 06 59-76 |
language |
English |
source |
Enthalten in Journal of algebraic combinatorics 52(2019), 1 vom: 10. Juni, Seite 59-76 volume:52 year:2019 number:1 day:10 month:06 pages:59-76 |
sourceStr |
Enthalten in Journal of algebraic combinatorics 52(2019), 1 vom: 10. Juni, Seite 59-76 volume:52 year:2019 number:1 day:10 month:06 pages:59-76 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
Haar graph Cayley graph Vertex-transitive graph |
dewey-raw |
510 |
isfreeaccess_bool |
false |
container_title |
Journal of algebraic combinatorics |
authorswithroles_txt_mv |
Feng, Yan-Quan @@aut@@ Kovács, István @@aut@@ Yang, Da-Wei @@aut@@ |
publishDateDaySort_date |
2019-06-10T00:00:00Z |
hierarchy_top_id |
131180770 |
dewey-sort |
3510 |
id |
OLC2077611650 |
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">OLC2077611650</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230505153711.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">221220s2019 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10801-019-00894-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2077611650</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10801-019-00894-7-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">On groups all of whose Haar graphs are Cayley graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</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, part of Springer Nature 2019</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract A Cayley graph of a group H is a finite simple graph $$\Gamma $$ such that $$\mathrm{Aut}(\Gamma )$$ contains a subgroup isomorphic to H acting regularly on $$V(\Gamma ),$$ while a Haar graph of H is a finite simple bipartite graph $$\Sigma $$ such that $$\mathrm{Aut}(\Sigma )$$ contains a subgroup isomorphic to H acting semiregularly on $$V(\Sigma )$$ and the H-orbits are equal to the bipartite sets of $$\Sigma $$. A Cayley graph is a Haar graph exactly when it is bipartite, but no simple condition is known for a Haar graph to be a Cayley graph. In this paper, we show that $$D_6, \, D_8, \, D_{10}$$ and $$Q_8$$ are the only finite inner abelian groups all of whose Haar graphs are Cayley graphs. (A group is called inner abelian if it is non-abelian, but all of its proper subgroups are abelian.) This result will then be used to derive that every non-solvable group admits a non-Cayley Haar graph.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Haar graph</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="700" ind1="1" ind2=" "><subfield code="a">Kovács, István</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yang, Da-Wei</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">52(2019), 1 vom: 10. Juni, Seite 59-76</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:52</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:1</subfield><subfield code="g">day:10</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:59-76</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10801-019-00894-7</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_70</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">52</subfield><subfield code="j">2019</subfield><subfield code="e">1</subfield><subfield code="b">10</subfield><subfield code="c">06</subfield><subfield code="h">59-76</subfield></datafield></record></collection>
|
author |
Feng, Yan-Quan |
spellingShingle |
Feng, Yan-Quan ddc 510 ssgn 17,1 misc Haar graph misc Cayley graph misc Vertex-transitive graph On groups all of whose Haar graphs are Cayley graphs |
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 |
collection |
OLC |
remote_str |
false |
illustrated |
Not Illustrated |
issn |
0925-9899 |
topic_title |
510 VZ 17,1 ssgn On groups all of whose Haar graphs are Cayley graphs Haar graph Cayley graph Vertex-transitive graph |
topic |
ddc 510 ssgn 17,1 misc Haar graph misc Cayley graph misc Vertex-transitive graph |
topic_unstemmed |
ddc 510 ssgn 17,1 misc Haar graph misc Cayley graph misc Vertex-transitive graph |
topic_browse |
ddc 510 ssgn 17,1 misc Haar graph misc Cayley graph misc Vertex-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 |
On groups all of whose Haar graphs are Cayley graphs |
ctrlnum |
(DE-627)OLC2077611650 (DE-He213)s10801-019-00894-7-p |
title_full |
On groups all of whose Haar graphs are Cayley graphs |
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 |
2019 |
contenttype_str_mv |
txt |
container_start_page |
59 |
author_browse |
Feng, Yan-Quan Kovács, István Yang, Da-Wei |
container_volume |
52 |
class |
510 VZ 17,1 ssgn |
format_se |
Aufsätze |
author-letter |
Feng, Yan-Quan |
doi_str_mv |
10.1007/s10801-019-00894-7 |
dewey-full |
510 |
title_sort |
on groups all of whose haar graphs are cayley graphs |
title_auth |
On groups all of whose Haar graphs are Cayley graphs |
abstract |
Abstract A Cayley graph of a group H is a finite simple graph $$\Gamma $$ such that $$\mathrm{Aut}(\Gamma )$$ contains a subgroup isomorphic to H acting regularly on $$V(\Gamma ),$$ while a Haar graph of H is a finite simple bipartite graph $$\Sigma $$ such that $$\mathrm{Aut}(\Sigma )$$ contains a subgroup isomorphic to H acting semiregularly on $$V(\Sigma )$$ and the H-orbits are equal to the bipartite sets of $$\Sigma $$. A Cayley graph is a Haar graph exactly when it is bipartite, but no simple condition is known for a Haar graph to be a Cayley graph. In this paper, we show that $$D_6, \, D_8, \, D_{10}$$ and $$Q_8$$ are the only finite inner abelian groups all of whose Haar graphs are Cayley graphs. (A group is called inner abelian if it is non-abelian, but all of its proper subgroups are abelian.) This result will then be used to derive that every non-solvable group admits a non-Cayley Haar graph. © Springer Science+Business Media, LLC, part of Springer Nature 2019 |
abstractGer |
Abstract A Cayley graph of a group H is a finite simple graph $$\Gamma $$ such that $$\mathrm{Aut}(\Gamma )$$ contains a subgroup isomorphic to H acting regularly on $$V(\Gamma ),$$ while a Haar graph of H is a finite simple bipartite graph $$\Sigma $$ such that $$\mathrm{Aut}(\Sigma )$$ contains a subgroup isomorphic to H acting semiregularly on $$V(\Sigma )$$ and the H-orbits are equal to the bipartite sets of $$\Sigma $$. A Cayley graph is a Haar graph exactly when it is bipartite, but no simple condition is known for a Haar graph to be a Cayley graph. In this paper, we show that $$D_6, \, D_8, \, D_{10}$$ and $$Q_8$$ are the only finite inner abelian groups all of whose Haar graphs are Cayley graphs. (A group is called inner abelian if it is non-abelian, but all of its proper subgroups are abelian.) This result will then be used to derive that every non-solvable group admits a non-Cayley Haar graph. © Springer Science+Business Media, LLC, part of Springer Nature 2019 |
abstract_unstemmed |
Abstract A Cayley graph of a group H is a finite simple graph $$\Gamma $$ such that $$\mathrm{Aut}(\Gamma )$$ contains a subgroup isomorphic to H acting regularly on $$V(\Gamma ),$$ while a Haar graph of H is a finite simple bipartite graph $$\Sigma $$ such that $$\mathrm{Aut}(\Sigma )$$ contains a subgroup isomorphic to H acting semiregularly on $$V(\Sigma )$$ and the H-orbits are equal to the bipartite sets of $$\Sigma $$. A Cayley graph is a Haar graph exactly when it is bipartite, but no simple condition is known for a Haar graph to be a Cayley graph. In this paper, we show that $$D_6, \, D_8, \, D_{10}$$ and $$Q_8$$ are the only finite inner abelian groups all of whose Haar graphs are Cayley graphs. (A group is called inner abelian if it is non-abelian, but all of its proper subgroups are abelian.) This result will then be used to derive that every non-solvable group admits a non-Cayley Haar graph. © Springer Science+Business Media, LLC, part of Springer Nature 2019 |
collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 |
container_issue |
1 |
title_short |
On groups all of whose Haar graphs are Cayley graphs |
url |
https://doi.org/10.1007/s10801-019-00894-7 |
remote_bool |
false |
author2 |
Kovács, István Yang, Da-Wei |
author2Str |
Kovács, István Yang, Da-Wei |
ppnlink |
131180770 |
mediatype_str_mv |
n |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1007/s10801-019-00894-7 |
up_date |
2024-07-03T16:27:29.210Z |
_version_ |
1803575937425473536 |
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">OLC2077611650</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230505153711.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">221220s2019 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10801-019-00894-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2077611650</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10801-019-00894-7-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">On groups all of whose Haar graphs are Cayley graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</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, part of Springer Nature 2019</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract A Cayley graph of a group H is a finite simple graph $$\Gamma $$ such that $$\mathrm{Aut}(\Gamma )$$ contains a subgroup isomorphic to H acting regularly on $$V(\Gamma ),$$ while a Haar graph of H is a finite simple bipartite graph $$\Sigma $$ such that $$\mathrm{Aut}(\Sigma )$$ contains a subgroup isomorphic to H acting semiregularly on $$V(\Sigma )$$ and the H-orbits are equal to the bipartite sets of $$\Sigma $$. A Cayley graph is a Haar graph exactly when it is bipartite, but no simple condition is known for a Haar graph to be a Cayley graph. In this paper, we show that $$D_6, \, D_8, \, D_{10}$$ and $$Q_8$$ are the only finite inner abelian groups all of whose Haar graphs are Cayley graphs. (A group is called inner abelian if it is non-abelian, but all of its proper subgroups are abelian.) This result will then be used to derive that every non-solvable group admits a non-Cayley Haar graph.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Haar graph</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="700" ind1="1" ind2=" "><subfield code="a">Kovács, István</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yang, Da-Wei</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">52(2019), 1 vom: 10. Juni, Seite 59-76</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:52</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:1</subfield><subfield code="g">day:10</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:59-76</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10801-019-00894-7</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_70</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">52</subfield><subfield code="j">2019</subfield><subfield code="e">1</subfield><subfield code="b">10</subfield><subfield code="c">06</subfield><subfield code="h">59-76</subfield></datafield></record></collection>
|
score |
7.400218 |