354 search results - page 50 / 71 » The Chromatic Number Of Graph Powers |
CORR
2010
Springer
14 years 9 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 ...
WSC
2007
14 years 11 months ago
2007
Event Graphs (EGs) and Simulation Graph Models provide a powerful and general modeling framework for discrete event simulation. Qualitative Event Graphs (QEGs) extend the EG frame...
JDA
2008
14 years 9 months ago
2008
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...
ICTAI
2010
IEEE
14 years 7 months ago
2010
IEEE
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
109
click to vote
SDM
2004
SIAM
14 years 11 months ago
2004
SIAM
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...