Related papers: The localization number and metric dimension of gr…
This paper deals with the maximum value of the difference between the determining number and the metric dimension of a graph as a function of its order. Our technique requires to use locating-dominating sets, and perform an independent…
The metric dimension of a graph $G$ is the minimum number of vertices in a subset $S$ of the vertex set of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $S$. In this paper we investigate the…
In this article we derive an explicit diameter bound for graphs satisfying the so-called curvature dimension conditions $CD(K,n)$. This refines a recent result due to Liu, M\"unch and Peyerimhoff when the dimension $n$ is finite.
Classical Hamming graphs are Cartesian products of complete graphs, and two vertices are adjacent if they differ in exactly one coordinate. Motivated by connections to unitary Cayley graphs, we consider a generalization where two vertices…
In this article, explicit formulas for finding the determining number and the metric dimension of the zero-divisor graph of Z_n and non-Boolean semisimple rings are given. In the case of Boolean rings, an upper bound of the determining…
The determining number of a graph $G = (V,E)$ is the minimum cardinality of a set $S\subseteq V$ such that pointwise stabilizer of $S$ under the action of $Aut(G)$ is trivial. In this paper, we provide some improved upper and lower bounds…
Given a coloring of the edges of the complete graph on n vertices in k colors, by considering the neighbors of an arbitrary vertex it follows that there is a monochromatic diameter two subgraph on at least 1+(n-1)/k vertices. We show that…
We prove that in the moduli space of genus-g metric graphs the locus of graphs with gonality at most d has the classical dimension min{3g-3,2g+2d-5}. This follows from a careful parameter count to establish the upper bound and a…
For $k \geq 1$ and $n \geq 2k$, the well known Kneser graph $\operatorname{KG}(n,k)$ has all $k$-element subsets of an $n$-element set as vertices; two such subsets are adjacent if they are disjoint. Schrijver constructed a vertex-critical…
The modelling of interconnection networks by graphs motivated the study of several extremal problems that involve well known parameters of a graph (degree, diameter, girth and order) and ask for the optimal value of one of them while…
This paper considers multiple domination on Kneser graphs. We focus on $k$-tuple dominating sets, $2$-packings and the associated graph parameters $k$-tuple domination number and $2$-packing number. In particular, we compute the $2$-packing…
The metric dimension is quite a well-studied graph parameter. Recently, the adjacency dimension and the local metric dimension have been introduced and studied. In this paper, we give a general formula for the local metric dimension of the…
The undirected degree/diameter and degree/girth problems and their directed analogues have been studied for many decades in the search for efficient network topologies. Recently such questions have received much attention in the setting of…
In this note, we investigate some properties of local Kneser graphs defined in [8]. In this regard, as a generalization of the Erd${\rm \ddot{o}}$s-Ko-Rado theorem, we characterize the maximum independent sets of local Kneser graphs. Next,…
We give a complete description of the distance relation on the graph of $4$-ary simplex codes of dimension $2$. This is a connected graph of diameter $3$. For every vertex we determine the sets of all vertices at distance $i\in\{1,2,3\}$…
A set of vertices $W$ resolves a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $W$. A metric dimension of $G$ is the minimum cardinality of a resolving set of $G$. A bipartite graph G(n,n) is…
We study characteristics which might distinguish two-graphs by introducing different numerical measures on the collection of graphs on $n$ vertices. Two conjectures are stated, one using these numerical measures and the other using the deck…
A set $D$ of vertices of a graph $G$ is a dissociation set if each vertex of $D$ has at most one neighbor in $D$. The dissociation number of $G$, $diss(G)$, is the cardinality of a maximum dissociation set in a graph $G$. In this paper we…
Let $G$ be a connected graph. Given an ordered set $W = \{w_1, w_2,\dots w_k\}\subseteq V(G)$ and a vertex $u\in V(G)$, the representation of $u$ with respect to $W$ is the ordered $k$-tuple $(d(u,w_1), d(u,w_2),\dots,$ $d(u,w_k))$, where…
Given a group G, the model $\mathcal{G}(G,p)$ denotes the probability space of all Cayley graphs of G where each element of the generating set is chosen independently at random with probability p. In this article we show that for any…