488 search results - page 10 / 98 » Automorphic Decompositions of Graphs |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
A vertex k-labeling of graph G is distinguishing if the only automorphism that preserves the labels of G is the identity map. The distinguishing number of G, D(G), is the smallest...
STACS
1992
Springer
13 years 11 months ago
1992
Springer
We show that the graph isomorphism problem is low for PP and for C=P, i.e., it does not provide a PP or C=P computation with any additional power when used as an oracle. Furthermor...
DAC
2008
ACM
14 years 8 months ago
2008
ACM
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
It is proven that the connected pathwidth of any graph G is at most 2
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
We introduces the umodules, a generalization of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and 2−structures...