925 search results - page 71 / 185 » Connectivity on Complete Lattices |
AML
2002
14 years 11 months ago
2002
Abstract. It is shown the complete equivalence between the theory of continuous (enumeration) fuzzy closure operators and the theory of (effective) fuzzy deduction systems in Hilbe...
COMBINATORICS
2000
14 years 11 months ago
2000
A counterexample is presented to Gy. Elekes's conjecture concerning the existence of long 2-colored paths in properly colored graphs. A modified version of the conjecture is ...
122
click to vote
EJC
2002
14 years 11 months ago
2002
In this short note the neighbourhood graph of a Cayley graph is considered. It has as nodes a symmetric generating set of a finitely-generated group . Two nodes are connected by a...
121
click to vote
TIFS
2010
14 years 6 months ago
2010
Abstract--We make a connection between steganography design by minimizing embedding distortion and statistical physics. The unique aspect of this work and one that distinguishes it...
CSR
2008
Springer
15 years 1 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...