Sciweavers

280 search results - page 1 / 56
» Using Determining Sets to Distinguish Kneser Graphs
Sort
View
COMBINATORICS
2007
73views more  COMBINATORICS 2007»
13 years 3 months ago
Using Determining Sets to Distinguish Kneser Graphs
This work introduces the technique of using a carefully chosen determining set to prove the existence of a distinguishing labeling using few labels. A graph G is said to be d-dist...
Michael O. Albertson, Debra L. Boutin
COMBINATORICS
2006
121views more  COMBINATORICS 2006»
13 years 3 months ago
Identifying Graph Automorphisms Using Determining Sets
A set of vertices S is a determining set for a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of a graph is the size of a sma...
Debra L. Boutin
EJC
2008
13 years 3 months ago
The distinguishing number of Cartesian products of complete graphs
The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d labels that is preserved only by a trivial automorphism. We prove that Cartesi...
Wilfried Imrich, Janja Jerebic, Sandi Klavzar
ICCS
2009
Springer
13 years 10 months ago
Distinguishing Answers in Conceptual Graph Knowledge Bases
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
Nicolas Moreau, Michel Leclère, Madalina Cr...
ICDAR
2005
IEEE
13 years 9 months ago
Distinguishing Mathematics Notation from English Text using Computational Geometry
A trainable method for distinguishing between mathematics notation and natural language (here, English) in images of textlines, using computational geometry methods only with no a...
Derek M. Drake, Henry S. Baird