620 search results - page 77 / 124 » The edge-flipping group of a graph |
AUTOMATICA
2010
13 years 9 months ago
2010
We propose a class of discrete-time dynamic average consensus algorithms that allow a group of agents to track the average of their reference inputs. The convergence results rely ...
CANDC
2006
ACM
13 years 9 months ago
2006
ACM
Large-scale experiments and data integration have provided the opportunity to systematically analyze and comprehensively understand the topology of biological networks and biochem...
COMBINATORICS
2006
13 years 9 months ago
2006
Let G be a graph. A vertex labeling of G is distinguishing if the only label-preserving automorphism of G is the identity map. The distinguishing number of G, D(G), is the minimum...
ENTCS
2006
13 years 8 months ago
2006
We present a system, called RZ, for automatic generation of program specifications from mathematical theories. We translate mathematical theories to specifications by computing th...
DM
2006
13 years 8 months ago
2006
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...