Minimum multiplicities of subgraphs and Hamiltonian systems
| dc.creator | Sheehan, John | |
| dc.date | 2000-12-28 | |
| dc.date.accessioned | 2026-07-07T04:39:26Z | |
| dc.date.available | 2026-07-07T04:39:26Z | |
| dc.description | Let G be a finite simple graph with automorphism group A(G). Then a spanning subgraph U of G is a fixing subgraph of G if G contains exactly $| A(G)|/ | A(G) \cap A(U)| $ subgraphs isomorphic to U: the graph G must always contain at least this number. If in addition $A(U) \subseteq A(G)$ then U is a strong fixing subgraph. Fixing subgraphs are important in many areas of graph theory. We consider them in the context of Hamiltonian graphs | |
| dc.description | to appear in Discrete Math | |
| dc.identifier | https://arxiv.org/abs/math/0012258 | |
| dc.identifier | http://arxiv.org/abs/math/0012258 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/60659 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C45 | |
| dc.title | Minimum multiplicities of subgraphs and Hamiltonian systems | |
| dc.type | text |