828 search results - page 66 / 166 » Simplicial Powers of Graphs |
PDCAT
2007
Springer
14 years 2 months ago
2007
Springer
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
GEOS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Conceptual Graphs are a very powerful knowledge and meaning representation formalism grounded on deep philosophical, linguistic and object oriented principles [1], [2]. C...
ESA
2010
Springer
13 years 9 months ago
2010
Springer
Motivated by the trend to outsource work to commercial cloud computing services, we consider a variation of the streaming paradigm where a streaming algorithm can be assisted by a...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
COMBINATORICA
2006
13 years 8 months ago
2006
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...