Results 31 to 40 of about 61,286 (267)
Metric-Based Fractional Dimension of Rotationally-Symmetric Line Networks [PDF]
Symmetry, 2023 The parameter of distance plays an important role in studying the properties symmetric networks such as connectedness, diameter, vertex centrality and complexity. Particularly different metric-based fractional models are used in diverse fields of computer science such as integer programming, pattern recognition, and in robot navigation.
Rashad Ismail +2 more
openalex +2 more sources
The fractional k-metric dimension of graphs
Applicable Analysis and Discrete Mathematics, 2018 Let G be a graph with vertex set V (G). For any two distinct vertices x and y of G, let R{x,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 U ? V (G), let g(U)= ? s?U g(s). Let k(G) = min{|R{x,y}|: x ? y and x,y ? V (G)}.
Cong X. Kang +2 more
openalex +5 more sources
, 2021 Point singularities of solutions to the classical Lane-Emden-Serrin equation have a polyhomogeneous asymptotic expansion whose logarithmic corrections are determined by a first order ODE. Surprisingly, we are able to discover such an ODE for the fractional Lane-Emden-Serrin equation, and therefore give a short classification for the precise local ...
Hardy Chan, Azahara DelaTorre
openalex +4 more sources
Fractional Metric Dimension of Tree and Unicyclic Graph
Procedia Computer Science, 2015 AbstractA vertex v in a simple connected graph G resolves two vertices x and y in G if the distance from x to v is not equal to distance from y to v. The vertex set R{x, y} is defined as the set of vertices in G which resolve x and y. A function f : V(G) → [0,1] is called a resolving function of G if f (R{x, y}) ≥ 1 for any two distinct vertices x and ...
Daniel A. Krismanto, Suhadi Wido Saputro
openalex +3 more sources
On Rotationally Symmetrical Planar Networks and Their Local Fractional Metric Dimension [PDF]
Symmetry, 2023 The metric dimension has various applications in several fields, such as computer science, image processing, pattern recognition, integer programming problems, drug discovery, and the production of various chemical compounds. The lowest number of vertices in a set with the condition that any vertex can be uniquely identified by the list of distances ...
Shahbaz Ali +4 more
openalex +2 more sources
On fractional metric dimension of comb product graphs
Statistics, Optimization & Information Computing, 2018 A vertex $z$ in a connected graph $G$ \textit{resolves} two vertices $u$ and $v$ in $G$ if $d_G(u,z)\neq d_G(v,z)$. \ A set of vertices $R_G\{u,v\}$ is a set of all resolving vertices of $u$ and $v$ in $G$. \ For every two distinct vertices $u$ and $v$ in $G$, a \textit{resolving function} $f$ of $G$ is a real function $f:V(G)\rightarrow[0,1]$ such ...
Suhadi Wido Saputro +3 more
openalex +3 more sources
Graphs with mixed metric dimension three and related algorithms
AIMS Mathematics, 2023 Let $ G = (V, E) $ be a simple connected graph. A vertex $ x\in V(G) $ resolves the elements $ u, v\in E(G)\cup V(G) $ if $ d_G(x, u)\neq d_G(x, v) $.
Dalal Awadh Alrowaili +3 more
doaj +1 more source
Metric Based Fractional Dimension of Toeplitz Networks
Punjab University Journal of Mathematics, 2023 : Metric dimension is one of the distance based graph - theoretic parameters which is widely used in the various disciplines of sciences such as computer science, chemistry, and engineering. The local fractional metric dimension is latest derived form of metric dimension and it is used to find the solutions of integer programming problems.
Hassan Zafar, Muhammad Javaid
openalex +2 more sources
On the fractional strong metric dimension of graphs
Discrete Applied Mathematics, 2016 For any two vertices x and y of a graph G , let S { x , y } denote the set of vertices z such that either x lies on a y - z geodesic or y lies on an x - z geodesic. For a function g defined on V ( G ) and U ź V ( G ) , let g ( U ) = ź x ź U g ( x ) . A function g : V ( G ) ź 0 , 1 is a strong resolving function of G if g ( S { x , y } ) ź 1 , for every
Cong X. Kang
openalex +3 more sources
Study of Convexo-Symmetric Networks via Fractional Dimensions
IEEE Access, 2022 For having an in-depth study and analysis of various network’s structural properties such as interconnection, extensibility, availability, centralization, vulnerability and reliability, we require distance based graph theoretic parameters ...
Muhammad Kamran Aslam +3 more
doaj +1 more source