488 search results - page 7 / 98 » Automorphic Decompositions of Graphs |
INFORMATICALT
2007
13 years 7 months ago
2007
In this paper we recall the notion of weakly decomposition, we recall some necessary and sufficient conditions for a graph to admit such a decomposition, we introduce the recognit...
IPL
2007
13 years 7 months ago
2007
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
EJC
2006
13 years 7 months ago
2006
A general method for finding elementary abelian regular covering projections of finite connected graphs is applied to the Petersen graph. As a result, a complete list of pairwise ...
COMBINATORICS
2002
13 years 7 months ago
2002
Let S be a subset of the units in Zn. Let be a circulant graph of order n (a Cayley graph of Zn) such that if ij E(), then i - j (mod n) S. Toida conjectured that if is another...
EJC
2008
13 years 7 months ago
2008
The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d labels that is preserved only by a trivial automorphism. We prove that Cartesi...