3204 search results - page 50 / 641 » The b-chromatic Number of a Graph |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
We present a short way of proving the inequalities obtained by Wright in [Journal of Graph Theory, 4: 393 – 407 (1980)] concerning the number of connected graphs with ℓ edges m...
WG
2004
Springer
14 years 3 months ago
2004
Springer
We show how to use split decomposition to compute the weighted clique number and the chromatic number of a graph and we apply these results to some classes of graphs. In particular...
WG
2004
Springer
14 years 3 months ago
2004
Springer
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...
ICDM
2009
IEEE
13 years 7 months ago
2009
IEEE
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...