3 search results - page 1 / 1 » On Computing the Distinguishing Numbers of Planar Graphs and... |
CORR
2007
Springer
14 years 9 months ago
2007
Springer
A vertex k-labeling of graph G is distinguishing if the only automorphism that preserves the labels of G is the identity map. The distinguishing number of G, D(G), is the smallest...
116
click to vote
ICALP
2009
Springer
15 years 9 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
152
Voted
CP
2009
Springer
15 years 10 months ago
2009
Springer
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...