A note on k-metric dimensional graphs
Copyright policy )A note on k-metric dimensional graphs
Given a graph $G = (V,E)$, a set $S \subset V$ is called a $k$-\emph{metric generator} for $G$ if any pair of different vertices of $G$ is distinguished by at least $k$ elements of $S$. A graph is $k$-\emph{metric dimensional} if $k$ is the largest integer such that there exists a $k$-metric generator for $G$. This paper studies some bounds on the number $k$ for which a graph is $k$-metric dimensional.
Comment: 11 pages, 3 figures
\(k\)-metric dimensional graph, Distance in graphs, block graph, metric dimension, Combinatorial aspects of block designs, clique tree, Graph designs and isomorphic decomposition, Mathematics - Combinatorics, Primary 05C12, 05C90 Secondary 05C69
\(k\)-metric dimensional graph, Distance in graphs, block graph, metric dimension, Combinatorial aspects of block designs, clique tree, Graph designs and isomorphic decomposition, Mathematics - Combinatorics, Primary 05C12, 05C90 Secondary 05C69
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).9 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!