99 search results - page 2 / 20 » On a class of finite symmetric graphs |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness ...
CIE
2008
Springer
13 years 10 months ago
2008
Springer
A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably catego...
CSL
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Although Cai, F¨urer and Immerman have shown that fixedpoint logic with counting (IFP + C) does not express all polynomialtime properties of finite structures, there h...
VMV
2008
13 years 9 months ago
2008
Median averaging is a powerful averaging concept on sets of vector data in finite dimensions. A generalization of the median for shapes in the plane is introduced. The underlying ...
CAI
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. In this paper we examine spectral properties of random intersection graphs when the number of vertices is equal to the number of labels. We call this class symmetric rand...