Buscar
Mostrando ítems 1-4 de 4
Artículo
On the determining number and the metric dimension of graphs
(Combinatorics.org, 2010)
This paper initiates a study on the problem of computing the difference between the metric dimension and the determining number of graphs. We provide new proofs and results on the determining number of trees and Cartesian ...
Artículo
Distinguishing graphs by their left and right homomorphism profiles
(Elsevier, 2011)
We introduce a new property of graphs called ‘q-state Potts unique-ness’ and relate it to chromatic and Tutte uniqueness, and also to ‘chromatic–flow uniqueness’, recently studied by Duan, Wu and Yu. We establish for ...
Artículo
Shortcut sets for plane Euclidean networks (Extended abstract)
(Elsevier, 2016)
We study the problem of augmenting the locus N of a plane Euclidean network N by inserting iteratively a finite set of segments, called shortcut set, while reducing the diameter of the locus of the resulting network. ...
Artículo
On the number of B-flows of a graph
(Elsevier, 2014)
We exhibit explicit constructions of contractors for the graph parameter counting the number of B-flows of a graph, where B is a subset of a finite Abelian group closed under inverses. These constructions are of great ...