YYÜ GCRIS Basic veritabanının içerik oluşturulması ve kurulumu Research Ecosystems (https://www.researchecosystems.com) tarafından devam etmektedir. Bu süreçte gördüğünüz verilerde eksikler olabilir.

Scopus İndeksli Yayınlar Koleksiyonu

Permanent URI for this collectionhttps://hdl.handle.net/20.500.14720/4

Browse

Browsing Scopus İndeksli Yayınlar Koleksiyonu by Author "Abbas, Azhar Ali"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    Article
    Investigating the Metric and Edge Metric Dimensions of H-Naphthalenic Nanotubes
    (Taru Publications, 2025) Chaudhry, Faryal; Afzal, Deeba; Hussein, Noor Mejbel; Abbas, Azhar Ali; Abbas, Wasim; Farahani, Mohammad Reza; Cancan, Murat
    If the distances between two vertices in a simple connected network are different, then a vertex x resolves the pair u and v. A set S of vertices in G is referred to as a resolving set if every pair of distinct vertices in G can be identified by at least one vertex in S. The metric dimension (MD) of G is the minimum number of vertices required for a resolving set. Moreover, an edge metric generator is any subset S of vertices that can distinguish between any two distinct edges, e1 and e2, according to their respective distances. An edge metric dimension (EMD), dime(G), is an edge metric generator of the least size. This study aims to explore the metric dimension (MD) and edge metric dimension (EMD) of the H-Naphthalenic Nanotube.
  • Thumbnail Image
    Article
    On Metric Dimension of Circumcoronene Series of Benzenoid Networks
    (Taru Publications, 2025) Chaudhry, Faryal; Abbas, Azhar Ali; Maktoof, Mohammed Abdul Jaleel; Farooq, Umar; Farahani, Mohammad Reza; Alaeiyan, Mehdi; Cancan, Murat
    In molecular topology and chemistry, resolving sets and metric bases are essential concepts. They have numerous applications in computer science, artificial intelligence, chemistry, pharmacy, traffic networking, mathematical modeling, and programming. Adivision S of the vertex set chi of a linked graph G is said to resolve G if eachpoint of G can be represented from its neighborhood in S. A metric dimension of a graph is the number of the smallest resolving set, also known as the metric basis of the graph.In the current research we will determine the metric dimension and metric basis of the circumcoronene series CS of benzenoid Hk for k >= 1. We prove that a set with three vertices is required to resolve this graph, and therefore, its metric dimension is 3.