On 2-switches and isomorphism classes

Details On 2-switches and isomorphism classes On 2-switches and isomorphism classes

2011-10-22

arxiv.org/abs/1110.4977v1

Mathematics

Combinatorics

11 pages, 6 figures

Scientific paper

A 2-switch is an edge addition/deletion operation that changes adjacencies in the graph while preserving the degree of each vertex. A well known result states that graphs with the same degree sequence may be changed into each other via sequences of 2-switches. We show that if a 2-switch changes the isomorphism class of a graph, then it must take place in one of four configurations. We also present a sufficient condition for a 2-switch to change the isomorphism class of a graph. As consequences, we give a new characterization of matrogenic graphs and determine the largest hereditary graph family whose members are all the unique realizations (up to isomorphism) of their respective degree sequences.

Affiliated with

Also associated with

No associations

Rating

On 2-switches and isomorphism classes 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 On 2-switches and isomorphism classes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On 2-switches and isomorphism classes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-564852