3267 search results - page 100 / 654 » Generalized quasirandom graphs |
EJC
2006
14 years 11 months ago
2006
As a generalization of Deza graphs, we introduce Deza digraphs and describe the basic theory of these graphs. We also prove the necessary and sufficient conditions when a weakly d...
COMBINATORICS
2007
14 years 11 months ago
2007
A graph is self-complementary if it is isomorphic to its complement. In this paper we prove that every forest of order 4p and size less than 3p is a subgraph of a self-complementa...
FGCS
2000
14 years 11 months ago
2000
: A general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. The framework is based on the concept of a construction...
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
— We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In particular, we show that for any positive integer k, the kth smallest eigenva...
ASSETS
2006
ACM
15 years 5 months ago
2006
ACM
We demonstrate the most recent version of our system to communicate graphs and relational information to blind users. We have developed a system called exPLoring graphs at UMB (PL...