a b s t r a c tWe study the maximum value of the difference between the metric dimension and the determining number of a graph as a function of its order. We develop a technique that uses functions related to locating-dominating sets to obtain lower and upper bounds on that maximum, and exact computations when restricting to some specific families of graphs. Our approach requires very diverse tools and connections with well-known objects in graph theory; among them: a classical result in graph domination by Ore, a Ramsey-type result by Erd} os and Szekeres, a polynomial time algorithm to compute distinguishing sets and determining sets of twin-free graphs, k-dominating sets, and matchings.
A set of vertices $S$ in a graph $G$ is a {\em resolving set} for $G$ if, for
any two vertices $u,v$, there exists $x\in S$ such that the distances $d(u,x)
\neq d(v,x)$. In this paper, we consider the Johnson graphs $J(n,k)$ and Kneser
graphs $K(n,k)$, and obtain various constructions of resolving sets for these
graphs. As well as general constructions, we show that various interesting
combinatorial objects can be used to obtain resolving sets in these graphs,
including (for Johnson graphs) projective planes and symmetric designs, as well
as (for Kneser graphs) partial geometries, Hadamard matrices, Steiner systems
and toroidal grids.Comment: 23 pages, 2 figures, 1 tabl
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 products of graphs, and establish some lower bounds on the difference between the two parameters.
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. There are two main differences with the classical augmentation problems: the endpoints of the segments are allowed to be points of N ℓ as well as points of the previously inserted segments (instead of only vertices of N ), and the notion of diameter is adapted to the fact that we deal with N ℓ instead of N . This increases enormously the hardness of the problem but also its possible practical applications to network design. Among other results, we characterize the existence of shortcut sets, compute them in polynomial time, and analyze the role of the convex hull of N ℓ when inserting a shortcut set. Our main results prove that, while the problem of minimizing the size of a shortcut set is NP-hard, one can always determine in polynomial time whether inserting only one segment suffices to reduce the diameter.
This paper deals with three resolving parameters: the metric dimension, the upper dimension and the resolving number. We first answer a question raised by Chartrand and Zhang asking for a characterization of the graphs with equal metric dimension and resolving number. We also solve in the affirmative a conjecture posed by Chartrand, Poisson and Zhang about the realization of the metric dimension and the upper dimension. Finally we prove that no integer a ≥ 4 is realizable as the resolving number of an infinite family of graphs.
We give a method of generating strongly polynomial sequences of graphs, i.e., sequences (H k ) indexed by a multivariate parameter k = (k1, . . . , k h ) such that, for each fixed graph G, there is a multivariate polynomial p(G; x1, . . . , x h ) such that the number of homomorphisms from G to H k is given by the evaluation p(G; k1, . . . , k h ). Our construction produces a large family of graph polynomials that includes the Tutte polynomial, the Averbouch-Godlin-Makowsky polynomial and the Tittmann-Averbouch-Makowsky polynomial. We also introduce a new graph parameter, the branching core size of a simple graph, related to how many involutive automorphisms with fixed points it has. We prove that a countable family of graphs of bounded branching core size (which in particular implies bounded tree-depth) can always be partitioned into a finite number of strongly polynomial subsequences.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.