On 2-switches and isomorphism classes

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.Comment: 11 pages, 6 figure

Geometrical characterization of semilinear isomorphisms of vector spaces and semilinear homeomorphisms of normed spaces

Let $V$ and $V'$ be vector spaces over division rings (possible infinite-dimensional) and let ${\mathcal P}(V)$ and ${\mathcal P}(V')$ be the associated projective spaces. We say that $f:{\mathcal P}(V)\to {\mathcal P}(V')$ is a PGL-{\it mapping} if for every $h\in {\rm PGL}(V)$ there exists $h'\in {\rm PGL}(V')$ such that $fh=h'f$. We show that for every PGL-bijection the inverse mapping is a semicollineation. Also, we obtain an analogue of this result for the projective spaces associated to normed spaces

Towards an Isomorphism Dichotomy for Hereditary Graph Classes

In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and algorithmic analysis of graphs. First, we develop a methodology to show isomorphism completeness of the isomorphism problem on graph classes by providing a general framework unifying various reduction techniques. Second, we generalize the concept of the modular decomposition to colored graphs, allowing for non-standard decompositions. We show that, given a suitable decomposition functor, the graph isomorphism problem reduces to checking isomorphism of colored prime graphs. Third, we extend the techniques of bounded color valence and hypergraph isomorphism on hypergraphs of bounded color size as follows. We say a colored graph has generalized color valence at most k if, after removing all vertices in color classes of size at most k, for each color class C every vertex has at most k neighbors in C or at most k non-neighbors in C. We show that isomorphism of graphs of bounded generalized color valence can be solved in polynomial time.Comment: 37 pages, 4 figure

Classes of Symmetric Cayley Graphs over Finite Abelian Groups of Degrees 4 and 6

The present work is devoted to characterize the family of symmetric undirected Cayley graphs over finite Abelian groups for degrees 4 and 6.Comment: 12 pages. A previous version of some of the results in this paper where first announced at 2010 International Workshop on Optimal Interconnection Networks (IWONT 2010). It is accessible at http://upcommons.upc.edu/revistes/handle/2099/1037

An "almost" full embedding of the category of graphs into the category of groups

We construct a functor from the category of graphs to the category of groups which is faithful and "almost" full, in the sense that it induces bijections of the Hom sets up to trivial homomorphisms and conjugation in the category of groups. We provide several applications of this construction to localizations (i.e. idempotent functors) in the category of groups and the homotopy category.Comment: 24 pages; to appear in Adv. Math