IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v6y2018i11p243-d181279.html
   My bibliography  Save this article

Edge Version of Metric Dimension and Doubly Resolving Sets of the Necklace Graph

Author

Listed:
  • Jia-Bao Liu

    (School of Mathematics and Physics, Anhui Jianzhu University, Hefei 230601, China)

  • Zohaib Zahid

    (Department of Mathematics, University of Management and Technology, Lahore 54000, Pakistan)

  • Ruby Nasir

    (Department of Mathematics, University of Management and Technology, Lahore 54000, Pakistan)

  • Waqas Nazeer

    (Division of Science and Technology, University of Education, Lahore 54000, Pakistan)

Abstract

Consider an undirected and connected graph G = ( V G , E G ) , where V G and E G represent the set of vertices and the set of edges respectively. The concept of edge version of metric dimension and doubly resolving sets is based on the distances of edges in a graph. In this paper, we find the edge version of metric dimension and doubly resolving sets for the necklace graph.

Suggested Citation

  • Jia-Bao Liu & Zohaib Zahid & Ruby Nasir & Waqas Nazeer, 2018. "Edge Version of Metric Dimension and Doubly Resolving Sets of the Necklace Graph," Mathematics, MDPI, vol. 6(11), pages 1-10, November.
    • Handle: RePEc:gam:jmathe:v:6:y:2018:i:11:p:243-:d:181279
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/6/11/243/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/6/11/243/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Su, Guifu & Xu, Lan, 2015. "Topological indices of the line graph of subdivision graphs and their Schur-bounds," Applied Mathematics and Computation, Elsevier, vol. 253(C), pages 395-401.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Shahid Imran & Muhammad Kamran Siddiqui & Muhammad Imran & Muhammad Faisal Nadeem, 2018. "Computing Topological Indices and Polynomials for Line Graphs," Mathematics, MDPI, vol. 6(8), pages 1-10, August.
    2. Adnan Aslam & Muhammad Faisal Nadeem & Zohaib Zahid & Sohail Zafar & Wei Gao, 2019. "Computing Certain Topological Indices of the Line Graphs of Subdivision Graphs of Some Rooted Product Graphs," Mathematics, MDPI, vol. 7(5), pages 1-9, April.
    3. Nadeem, Muhammad Faisal & Zafar, Sohail & Zahid, Zohaib, 2015. "On certain topological indices of the line graph of subdivision graphs," Applied Mathematics and Computation, Elsevier, vol. 271(C), pages 790-794.
    4. Chen, Xiaohong, 2023. "General sum-connectivity index of a graph and its line graph," Applied Mathematics and Computation, Elsevier, vol. 443(C).
    5. Nadeem, Muhammad Faisal & Zafar, Sohail & Zahid, Zohaib, 2016. "On topological properties of the line graphs of subdivision graphs of certain nanostructures," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 125-130.
    6. Walter Carballosa & José Manuel Rodríguez & José María Sigarreta & Nodari Vakhania, 2019. "f -Polynomial on Some Graph Operations," Mathematics, MDPI, vol. 7(11), pages 1-18, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:6:y:2018:i:11:p:243-:d:181279. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.