A CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION
Authors
Abstract:
The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$. In this case, $B$ is called a textit{metric basis} for $G$. The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$. Giving a characterization for those graphs whose metric dimensions are two, we enumerate the number of $n$ vertex metric two dimensional graphs with basic distance 1.
similar resources
Graphs with Metric Dimension Two-A Characterization
In this paper, we define distance partition of vertex set of a graph G with reference to a vertex in it and with the help of the same, a graph with metric dimension two (i.e. 2 ) ( = G β ) is characterized. In the process, we develop a polynomial time algorithm that verifies if the metric dimension of a given graph G is two. The same algorithm explores all metric bases of graph G whenever 2 ) (...
full textOn two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
full textSolis Graphs and Uniquely Metric Basis Graphs
A set $Wsubset V (G)$ is called a resolving set, if for every two distinct vertices $u, v in V (G)$ there exists $win W$ such that $d(u,w) not = d(v,w)$, where $d(x, y)$ is the distance between the vertices $x$ and $y$. A resolving set for $G$ with minimum cardinality is called a metric basis. A graph with a unique metric basis is called a uniquely dimensional graph. In this paper, we establish...
full textA Complete Characterization of the 1-Dimensional Intrinsic Čech Persistence Diagrams for Metric Graphs
Metric graphs are special types of metric spaces used to model and represent simple, ubiquitous, geometric relations in data such as biological networks, social networks, and road networks. We are interested in giving a qualitative description of metric graphs using topological summaries. In particular, we provide a complete characterization of the 1-dimensional intrinsic Čech persistence diagr...
full textTwo-dimensional metric-affine gravity
There is a number of completely integrable gravity theories in two dimensions. We study the metric-affine approach on a 2-dimensional spacetime and display a new integrable model. Its properties are described and compared with the known results of Poincaré gauge gravity. PACS: 04.50.+h, 04.20.Fy, 04.20.Jb, 04.60.Kz, 02.30.Ik
full textTwo - Dimensional Regular Languages and Their Syntactic Characterization
In this paper, we deal with two-dimensional rectangular arrays for representing row and column structures such as symbol tables, spreadsheets, etc. Firstly we formalize the two-dimensional regular languages by pairs of regular expressions for rows and columns. Next we also introduce context-sensitive graph grammars called labeled grid graph grammars, which characterize the two-dimensional regul...
full textMy Resources
Journal title
volume 7 issue 2
pages 179- 187
publication date 2020-01-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023