Adjacency metric dimension of the 2-absorbing ideals graph
Authors
Abstract:
Let Γ=(V,E) be a graph and W_(a)={w_1,…,w_k } be a subset of the vertices of Γ and v be a vertex of it. The k-vector r_2 (v∣ W_a)=(a_Γ (v,w_1),… ,a_Γ (v,w_k)) is the adjacency representation of v with respect to W in which a_Γ (v,w_i )=min{2,d_Γ (v,w_i )} and d_Γ (v,w_i ) is the distance between v and w_i in Γ. W_a is called as an adjacency resolving set for Γ if distinct vertices of Γ have distinct adjacency representations w.r.t W_a. The size of the smallest adjacency resolving set is the adjacency metric dimension of Γ and is denoted by dim_a(Γ). In this paper, we prove that dim_a(Γ_E (Z_(P^n ) ))=⌈(n-2)/2⌉. Also, we show that Γ_E (Z_(p^2n ) )≅Γ_E (R/I) in which p is a prime number, n is a natural number and I is a 2-absorbing ideal of the ring R which has a minimal primitive decomposition in the form of the intersection of n primitive ideals. Finally we conclude that dim_a〖(Γ_E (R/I))=n-1〗.
similar resources
On L - Fuzzy 2 - Absorbing Ideals
Let L be a complete lattice. In this paper we introduce various definitions of L-fuzzy 2-absorbing ideals of a commutative ring R and give some basic results concerning these classes of ideals.
full textThe metric dimension and girth of graphs
A set $Wsubseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,vin V(G)$ there exists $win W$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $dim(G)$. In this paper, it is proved that in a connected graph $...
full textOn the metric dimension of Cartesian powers of a graph
A set of vertices S resolves a graph if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of a graph is the minimum cardinality of a resolving set of the graph. Fix a connected graph G on q ≥ 2 vertices, and let M be the distance matrix of G. We prove that if there exists w ∈ Z such that ∑ i wi = 0 and the vector Mw, after sorting its coor...
full textThe Local Metric Dimension of Cyclic Split Graph
Let , be a graph with vertex set and edge set . Let then is said to be a local metric basis of , if for any two adjacent vertices , ⁄ , there exists a such that , , . The minimum cardinality of local metric basis is called the local metric dimension (lmd) of graph G. In this paper we investigate the local metric basis and local metric dimension of Cyclic Split Graph .
full textThe Simultaneous Local Metric Dimension of Graph Families
In a graph G = (V, E), a vertex v ∈ V is said to distinguish two vertices x and y if dG(v, x) 6= dG(v, y). A set S ⊆ V is said to be a local metric generator for G if any pair of adjacent vertices of G is distinguished by some element of S. A minimum local metric generator is called a local metric basis and its cardinality the local metric dimension of G. A set S ⊆ V is said to be a simultaneou...
full textThe metric dimension of the circulant graph C(n, \pm\{1, 2, 3, 4\})
Let G = (V, E) be a connected graph and let d(u, v) denote the distance between vertices u, v ∈ V. A metric basis for G is a set B ⊆ V of minimum cardinality such that no two vertices of G have the same distances to all points of B. The cardinality of a metric basis of G is called the metric dimension of G, denoted by dim(G). In this paper we determine the metric dimension of the circulant grap...
full textMy Resources
Journal title
volume 5 issue 19
pages 37- 48
publication date 1970-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