Minimum multiplicities of subgraphs and Hamiltonian systems

Details Minimum multiplicities of subgraphs and Hamiltonian systems Minimum multiplicities of subgraphs and Hamiltonian systems

2000-12-28

arxiv.org/abs/math/0012258v1

Mathematics

Combinatorics

to appear in Discrete Math

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Minimum multiplicities of subgraphs and Hamiltonian systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimum multiplicities of subgraphs and Hamiltonian systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimum multiplicities of subgraphs and Hamiltonian systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-561698