4137 search results - page 26 / 828 » On the number of matchings of a tree |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We show that the number of k-matching in a given undirected graph G is equal to the number of perfect matching of the corresponding graph Gk on an even number of vertices divided ...
GD
2007
Springer
14 years 1 months ago
2007
Springer
We add two minimum level nonplanar (MLNP) patterns for trees to the previous set of tree patterns given by Healy et al. [3]. Neither of these patterns match any of the previous pat...
ICWE
2005
Springer
14 years 1 months ago
2005
Springer
XML Schema is becoming an indispensable component in developing web applications. With its widespread adoption and its web accessibility, XML Schema reuse is becoming imperative. T...
APPML
2011
13 years 2 months ago
2011
The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove t...
ECCV
1998
Springer
14 years 9 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...