Browsing by Author "Sardar, M.S."

Now showing 1 - 5 of 5

Computing Metric Dimension of Two Types of Claw-Free Cubic Graphs With Applications
(Charles Babbage Research Centre, 2024) Sardar, M.S.; Xu, S.-J.; Cancan, M.; Farahani, M.R.; Alaeiyan, M.; Patil, S.V.
Consider the simple connected graph G with vertex set V(G) and edge set E(G). A graph G can be resolved by R if each vertex’s representation of distances to the other vertices in R uniquely identifies it. The minimum cardinality of the set R is the metric dimension of G. The length of the shortest path between any two vertices, x, y in V(G), is signified by the distance symbol d(x, y). An ordered k-tuple r(x/R) = (d(x, z1), d(x, z2), ..., d(x, zk)) represents representation of x with respect to R for an ordered subset R = {z1, z2, z3..., zk} of vertices and vertex x in a connected graph. Metric dimension is used in a wide range of contexts where connection, distance, and connectedness are essential factors. It facilitates understanding the structure and dynamics of complex networks and problems relating to robotics network design, navigation, optimization, and facility location. Robots can optimize their localization and navigation methods using a small number of reference sites due to the pertinent idea of metric dimension. As a result, many robotic applications, such as collaborative robotics, autonomous navigation, and environment mapping, are more accurate, efficient, and resilient. A claw-free cubic graph (CCG) is one in which no induced subgraph is a claw. CCG proves helpful in various fields, including optimization, network design, and algorithm development. They offer intriguing structural and algorithmic properties. Developing algorithms and results for claw-free graphs frequently has applications in solving of challenging real-world situations. The metric dimension of a couple of claw-free cubic graphs (CCG), a string of diamonds (SOD), and a ring of diamonds (ROD) will be determined in this work. © 2024 the Author(s), licensee Combinatorial Press.
Fault Tolerant Metric Dimension of Arithmetic Graphs
(Charles Babbage Research Centre, 2024) Sardar, M.S.; Rasheed, K.; Cancan, M.; Farahani, M.R.; Alaeiyan, M.; Patil, S.V.
For a graph G, two vertices x, y ∈ G are said to be resolved by a vertex s ∈ G if d(x|s), d(y|s), where d(x|s) denotes the distance between x and s. The minimum cardinality of such a resolving set R in G is called the metric dimension. A resolving set R is said to be fault-tolerant if, for every p ∈ R, the set R − p preserves the property of being a resolving set. The fault-tolerant metric dimension of G is the minimal possible order of a fault-tolerant resolving set. The concept of metric dimension has wide applications in areas where connection, distance, and network connectivity are critical. This includes understanding the structure and dynamics of complex networks, as well as addressing problems in robotic network design, navigation, optimization, and facility placement. By utilizing the concept of metric dimension, robots can optimize their methods for localization and navigation using a limited number of reference points. As a result, various applications in robotics, such as collaborative robotics, autonomous navigation, and environment mapping, have become more precise, efficient, and resilient. The arithmetic graph Al is defined as the graph where the vertex set is the set of all divisors of a composite number l, where l = pγ11 pη22 · · · pαnn and the pi’s are distinct primes with pi ≥ 2. Two distinct divisors x and y of l are said to have the same parity if they share the same prime factors (e.g., x = p1p2 and y = p21p32 have the same parity). Furthermore, two distinct vertices x, y ∈ Al are adjacent if and only if they have different parity and gcd(x, y) = pi (greatest common divisor) for some i ∈ {1, 2, . . ., t}. This article focuses on the investigation of the arithmetic graph of a composite number l, referred to throughout as Al. In this study, we compute the fault-tolerant resolving set and the fault-tolerant metric dimension of the arithmetic graph Al, where l is a composite number. © 2024 the Author(s), licensee Combinatorial Press.
On Topological Indices of Double and Strong Double Graph of Silicon Carbide Si2c3-I
(Sami Publishing Company, 2023) Sardar, M.S.; Ali, M.A.; Ashraf, F.; Cancan, M.
Silicon is a semiconductor material with several advantages over the other similar materials, such as its low cost, nontoxicity, and almost limitless availability, as well as many years of expertise in its purification, manufacture, and device development. It is used in practical for all of the most recent electrical products. Graph theory can be used to depict a chemical structure, with vertices representing atoms and edges representing chemical bonds. Molecular descriptors are important in mathematical chemistry, particularly in QSPR/QSAR research. In this research, by using two graph operations, namely; double and strong double graph, we computed the closed formulas for some degree-based topological indices of silicon carbide. Furthermore, we also compare topological indices numerically and graphically. Copyright © 2023 by SPC.
Some Resistance Distance and Distance-Based Graph Invariants and Number of Spanning Trees in the Tensor Product of Pz and Kn
(Universidad Catolica del Norte, 2020) Sardar, M.S.; Cancan, M.; Ediz, S.; Sajjad, W.
The resistance distance (Kirchhoff index and multiplicative Kirchhoff index) and distance-based (Wiener index and Gutman index) graph invariants of Γn = p2 x Kn are considered. Firstly by using the decomposition theorem, we procure the Laplacian and Normalized Laplacian spectrum for graph r n, respectively. Based on which, we can procured the formulae for the number of spanning trees and some resistance distance and distancebased graph invariants of graph Γn. Also, it is very interesting to see that when n tends to infinity, Kf (Γn) is a polynomial and W (Γn) is a quadratic polynomial. © 2020 Muhammad Shoaib Sardar, Murat Cancan, SUleyman Ediz and Wasim Sajjad.
Study of Middle Graph for Certain Classes of Graph by Applying Degree-Based Topological Indices
(Sami Publishing Company, 2023) Sardar, M.S.; Ali, M.A.; Ashraf, F.; Cancan, M.
Topological indices are extremely useful for analyzing various physical and chemical properties associated with a chemical compound. A topological index describes molecular structures by converting them into certain real numbers. Topological indices are used in the development of quantitative structure-activity relationships (QSARs) in which the biological activity of molecule correlated with their chemical structure. The chemical shape of benzene molecule is very common in nano-science, chemistry, and physics. The circumcoronene collection of benzenoid (Hs) generates from the benzene molecules. Jahangir graph (J(m,t)) is a generalized wheel graph that consists of (m, t) circular vertices and a center vertex connected to every mt vertex on the circle. In this article, we will compute the topological indices of the middle graph of the circumcoronene series of benzenoids (Hs) and Jahangir graph (J(m,t)). In addition, comparison of the middle graph of the circumcoronene series of benzenoid (Hs) and Jahangir graph (J(3,t)) are presented numerically and graphically. Copyright © 2023 by SPC.