On the dimension of a graph
WebClick on the article title to read more. Web1 de abr. de 1998 · Our main new results are that the metric dimension of a graph with n nodes can be approximated in polynomial time within a factor of O(logn), and some …
On the dimension of a graph
Did you know?
WebKEYWORDS: Metric Dimension; Basis; Resolving Set; Dragon Graph. JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.2 No.1, January 20 , 2012 ABSTRACT: If G is a connected graph, the distance d (u,v) between two ... WebIn this context, we propose a fuzzy lowdimensional representation by mapping any given graph onto a k-dimensional space such that the distance between any two nodes determines their adjacency status. The proposed mapping utilizes an intersection graph representation where k-dimensional balls represent the nodes, and the likelihood of …
Web4 de jul. de 2024 · In this paper, we establish bounds on the domination number and the metric dimension of the co-normal product graph \(G_{H}\) of two simple graphs G and H in terms of parameters associated with G and H.We also give conditions on the graphs G and H for which the domination number of \(G_{H}\) is 1, 2, and the domination number … http://www.scholarpedia.org/article/Metric_Dimension
WebThe following settings affect the calculation and display of available members for the Time dimension on the Members tab in the Selector Tool for the plan: The default value for the Demand History Days field is 182 days. Note: If data isn't available, blank rows are displayed for the time periods included in tables and graphs. WebCorollary 2.4. A tree T of order n ≥ 4 is (2, t)-metric dimensional if and only if T contains a support vertex which is adjacent to at least two leaves. An example of a (2, t)-metric dimensional tree is the star graph K1,n−1 , whose (2, t)-metric dimension is dim2,t (K1,n−1 ) = n−1.
Web11 de abr. de 2024 · It is proved that the maximum distance between any two vertices of A m is two or three, and exact formulae are given for the metric dimension of Am, when m has exactly two distinct prime divisors. This paper is devoted to the study of the arithmetic graph of a composite number m, denoted by A m . It has been observed that there exist …
Web1 de mar. de 2007 · In this work the exact values of the dimension of graph G are calculated for some important families of graphs: the complete graphs, the bipartite complete … how many employees in fortune 500 companiesWeb26 de jul. de 2005 · A set S of vertices in a graph G resolves G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of G is the minimum cardinality of a resolving set of G. This paper studies the metric dimension of cartesian products G*H. We prove that the metric dimension of G*G is tied in a strong … how many employees in hsbcWeb31 de dez. de 2024 · The outer multiset dimension \textrm {dim}_\textrm {ms} (G) of a graph G is the cardinality of a smallest set of vertices that uniquely recognize all the vertices outside this set by using multisets of distances to the set. It is proved that \textrm {dim}_\textrm {ms} (G) = n (G) - 1 if and only if G is a regular graph with diameter at most 2. high traffic low maintenance grassWeb11 de abr. de 2024 · This paper is devoted to the study of the arithmetic graph of a composite number m, denoted by A m . It has been observed that there exist different composite numbers for which the arithmetic graphs are isomorphic. It is proved that the maximum distance between any two vertices of A m is two or three. Conditions under … high traffic laminate flooringhigh traffic grass matsWeb27 de abr. de 2024 · THE METRIC DIMENSION OF THE ANNIHILATING-IDEAL GRAPH OF A FINITE COMMUTATIVE RING - Volume 103 Issue 3. Skip to main content Accessibility help We use cookies to distinguish you from other users and to provide you with a better experience on our websites. high traffic exterior paintWebOur purpose in this note is to present a natural geometrical definition of the dimension of a graph and to explore some of its ramifications. In §1 we determine the dimension of some special graphs. We observe in §2 that several results in the literature are unified by the … high traffic floor wax