The fractional k-metric dimension of graphs

From MaRDI portal
Publication:5028802

DOI10.2298/AADM170712023KzbMATH Open1499.05187arXiv1706.05550OpenAlexW2963649608WikidataQ128754783 ScholiaQ128754783MaRDI QIDQ5028802FDOQ5028802


Authors: Cong X. Kang, Ismael G. Yero, Eunjeong Yi Edit this on Wikidata


Publication date: 10 February 2022

Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

Abstract: Let G be a graph with vertex set V(G). For any two distinct vertices x and y of G, let Rx,y denote the set of vertices z such that the distance from x to z is not equal to the distance from y to z in G. For a function g defined on V(G) and for UsubseteqV(G), let g(U)=sumsinUg(s). Let kappa(G)=min|Rx,y|:xeqymboxandx,yinV(G). For any real number kin[1,kappa(G)], a real-valued function g:V(G)ightarrow[0,1] is a emph{k-resolving function} of G if g(Rx,y)gek for any two distinct vertices x,yinV(G). The emph{fractional k-metric dimension}, dimfk(G), of G is k. In this paper, we initiate the study of the fractional k-metric dimension of graphs. For a connected graph G and kin[1,kappa(G)], it's easy to see that kledimfk(G)lefrack|V(G)|kappa(G); we characterize graphs G satisfying dimfk(G)=k and dimfk(G)=|V(G)|, respectively. We show that dimfk(G)gekdimf(G) for any kin[1,kappa(G)], and we give an example showing that dimfk(G)kdimf(G) can be arbitrarily large for some kin(1,kappa(G)]; we also describe a condition for which dimfk(G)=kdimf(G) holds. We determine the fractional k-metric dimension for some classes of graphs, and conclude with two open problems, including whether phi(k)=dimfk(G) is a continuous function of k on every connected graph G.


Full work available at URL: https://arxiv.org/abs/1706.05550




Recommendations




Cites Work


Cited In (9)





This page was built for publication: The fractional \(k\)-metric dimension of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5028802)