Metraipolis › archive › dc_9534720cdb01

Fibre factorization and automorphisms of direct products of bipartite graphs — arXiv:2611.00775

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.00775
License (as archived)
CC0-1.0
Archived
2026-11-03T11:36:35.990Z
SHA-256 of the archived text
c0c7fd82279e7e7750bc2909e437fcaeb08dad31149649f168e104beca625efa
Stable URL of this page
https://metraipolis.com/documento/dc_9534720cdb01

How to cite

Fibre factorization and automorphisms of direct products of bipartite graphs — arXiv:2611.00775 — arXiv (en), https://arxiv.org/abs/2611.00775 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9534720cdb01 (Metraipolis archive dc_9534720cdb01, sha256 c0c7fd82279e7e7750bc2909e437fcaeb08dad31149649f168e104beca625efa)
BibTeX
@misc{dc9534720cdb01,
  title = {Fibre factorization and automorphisms of direct products of bipartite graphs — arXiv:2611.00775},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.00775},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9534720cdb01; sha256 c0c7fd82279e7e7750bc2909e437fcaeb08dad31149649f168e104beca625efa},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.00775. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We determine the automorphism groups of direct products of finite connected twin-free bipartite graphs whose factors are different from $K_2$. The product is generally disconnected, so the problem requires both the automorphism groups of its components and a criterion for component isomorphism. We retain the order of the bipartition classes and use the fibre product over $K_2$. An edge-relation construction, together with McKenzie's strict refinement theorem, yields unique fibre-prime factorization and a coordinate description of every specified isomorphism. After refining the original factors, component isomorphism classes are described by intersections of factor-symmetry orbits with a set of admissible labels. The stabilizer of a label acts faithfully as the fullautomorphism group of its component. These data determine the full automorphism group, including products with repeated or fibre-composite factors. For products of fibre powers of one prime graph, we compute the component groups and express their multiplicities through a subset-sum polynomial. We also obtain an explicit semidirect product for a mixed product with one nonbipartite factor and explain its relation to known stability results. An application recovers the known double-cover groups of bipartite generalized Petersen graphs.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.00775 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:05:22.242Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).