Cores of vertex transitive graphs
From MaRDI portal
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Abstract: A core of a graph X is a vertex minimal subgraph to which X admits a homomorphism. Hahn and Tardif have shown that for vertex transitive graphs, the size of the core must divide the size of the graph. This motivates the following question: when can the vertex set of a vertex transitive graph be partitioned into sets each of which induce a copy of its core? We show that normal Cayley graphs and vertex transitive graphs with cores half their size always admit such partitions. We also show that the vertex sets of vertex transitive graphs with cores less than half their size do not, in general, have such partitions.
Recommendations
Cites work
Cited in
(9)- CORES OF SYMMETRIC GRAPHS
- \(\lambda\)-core distance partitions
- Cores of cubelike graphs
- scientific article; zbMATH DE number 434696 (Why is no real title available?)
- The core of a complementary prism
- Cores of imprimitive symmetric graphs of order a product of two distinct primes
- The core of a vertex-transitive complementary prism
- Cores of non-normal Cayley graphs of order ${p^2}$
- On Minkowski space and finite geometry
This page was built for publication: Cores of vertex transitive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1953537)