IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v333y2018icp547-555.html
   My bibliography  Save this article

Graph operations based on using distance-based graph entropies

Author

Listed:
  • Ghorbani, Modjtaba
  • Dehmer, Matthias
  • Zangi, Samaneh

Abstract

Let G be a connected graph. The eccentricity of vertex v is the maximum distance between v and other vertices of G. In this paper, we study a new version of graph entropy based on eccentricity of vertices of G. In continuing, we study this graph entropy for some classes of graph operations. Finally, we compute the graph entropy of two classes of fullerene graphs.

Suggested Citation

  • Ghorbani, Modjtaba & Dehmer, Matthias & Zangi, Samaneh, 2018. "Graph operations based on using distance-based graph entropies," Applied Mathematics and Computation, Elsevier, vol. 333(C), pages 547-555.
    • Handle: RePEc:eee:apmaco:v:333:y:2018:i:c:p:547-555
    DOI: 10.1016/j.amc.2018.04.003
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318303072
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.04.003?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Dehmer, Matthias & Emmert-Streib, Frank & Shi, Yongtang, 2015. "Graph distance measures based on topological indices revisited," Applied Mathematics and Computation, Elsevier, vol. 266(C), pages 623-633.
    2. Li, Xueliang & Qin, Zhongmei & Wei, Meiqin & Gutman, Ivan & Dehmer, Matthias, 2015. "Novel inequalities for generalized graph entropies – Graph energies and topological indices," Applied Mathematics and Computation, Elsevier, vol. 259(C), pages 470-479.
    3. Matthias Dehmer & Abbe Mowshowitz & Frank Emmert-Streib, 2011. "Connections between Classical and Parametric Network Entropies," PLOS ONE, Public Library of Science, vol. 6(1), pages 1-8, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Modjtaba Ghorbani & Matthias Dehmer & Frank Emmert-Streib, 2020. "Properties of Entropy-Based Topological Measures of Fullerenes," Mathematics, MDPI, vol. 8(5), pages 1-23, May.
    2. Maryam Jalali-Rad & Modjtaba Ghorbani & Matthias Dehmer & Frank Emmert-Streib, 2021. "Orbit Entropy and Symmetry Index Revisited," Mathematics, MDPI, vol. 9(10), pages 1-13, May.

    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. Ghorbani, Modjtaba & Dehmer, Matthias & Rajabi-Parsa, Mina & Emmert-Streib, Frank & Mowshowitz, Abbe, 2019. "Hosoya entropy of fullerene graphs," Applied Mathematics and Computation, Elsevier, vol. 352(C), pages 88-98.
    2. Modjtaba Ghorbani & Matthias Dehmer & Frank Emmert-Streib, 2020. "Properties of Entropy-Based Topological Measures of Fullerenes," Mathematics, MDPI, vol. 8(5), pages 1-23, May.
    3. Knor, Martin & Škrekovski, Riste & Tepeh, Aleksandra, 2016. "Digraphs with large maximum Wiener index," Applied Mathematics and Computation, Elsevier, vol. 284(C), pages 260-267.
    4. Das, Kinkar Ch. & Mojallal, Seyed Ahmad & Gutman, Ivan, 2016. "On energy and Laplacian energy of bipartite graphs," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 759-766.
    5. Li, Hong-Hai & Wu, Qian-Qian & Gutman, Ivan, 2016. "On ordering of complements of graphs with respect to matching numbers," Applied Mathematics and Computation, Elsevier, vol. 282(C), pages 167-174.
    6. Lavanya Sivakumar & Matthias Dehmer, 2012. "Towards Information Inequalities for Generalized Graph Entropies," PLOS ONE, Public Library of Science, vol. 7(6), pages 1-14, June.
    7. Knor, Martin & Škrekovski, Riste & Tepeh, Aleksandra, 2015. "An inequality between the edge-Wiener index and the Wiener index of a graph," Applied Mathematics and Computation, Elsevier, vol. 269(C), pages 714-721.
    8. Yu, Guihai & Li, Xingfu, 2020. "Connective Steiner 3-eccentricity index and network similarity measure," Applied Mathematics and Computation, Elsevier, vol. 386(C).
    9. Milovanović, Igor & Milovanović, Emina & Gutman, Ivan, 2016. "Upper bounds for some graph energies," Applied Mathematics and Computation, Elsevier, vol. 289(C), pages 435-443.
    10. Safaei, F. & Yeganloo, H. & Akbar, R., 2020. "Robustness on topology reconfiguration of complex networks: An entropic approach," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 170(C), pages 379-409.
    11. Carlos F Alvarez & Luis E Palafox & Leocundo Aguilar & Mauricio A Sanchez & Luis G Martinez, 2016. "Using Link Disconnection Entropy Disorder to Detect Fast Moving Nodes in MANETs," PLOS ONE, Public Library of Science, vol. 11(5), pages 1-15, May.
    12. Ilić, Aleksandar & Ilić, Milovan, 2017. "Counterexamples to conjectures on graph distance measures based on topological indexes," Applied Mathematics and Computation, Elsevier, vol. 296(C), pages 148-152.
    13. Rodríguez, José M. & Sigarreta, José M., 2016. "Spectral properties of geometric–arithmetic index," Applied Mathematics and Computation, Elsevier, vol. 277(C), pages 142-153.
    14. Ghorbani, Modjtaba & Hakimi-Nezhaad, Mardjan & Dehmer, Matthias, 2022. "Novel results on partial hosoya polynomials: An application in chemistry," Applied Mathematics and Computation, Elsevier, vol. 433(C).
    15. Das, Kinkar Ch. & Gutman, Ivan & Nadjafi–Arani, Mohammad J., 2015. "Relations between distance–based and degree–based topological indices," Applied Mathematics and Computation, Elsevier, vol. 270(C), pages 142-147.
    16. Choi, Hayoung & Lee, Hosoo & Shen, Yifei & Shi, Yuanming, 2019. "Comparing large-scale graphs based on quantum probability theory," Applied Mathematics and Computation, Elsevier, vol. 358(C), pages 1-15.
    17. Maryam Jalali-Rad & Modjtaba Ghorbani & Matthias Dehmer & Frank Emmert-Streib, 2021. "Orbit Entropy and Symmetry Index Revisited," Mathematics, MDPI, vol. 9(10), pages 1-13, May.
    18. Liu, Muhuo & Das, Kinkar Ch., 2018. "On the ordering of distance-based invariants of graphs," Applied Mathematics and Computation, Elsevier, vol. 324(C), pages 191-201.
    19. Das, Kinkar Ch. & Mojallal, Seyed Ahmad & Gutman, Ivan, 2015. "On Laplacian energy in terms of graph invariants," Applied Mathematics and Computation, Elsevier, vol. 268(C), pages 83-92.
    20. Das, Kinkar Ch. & Mojallal, Seyed Ahmad, 2016. "Extremal Laplacian energy of threshold graphs," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 267-280.

    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:eee:apmaco:v:333:y:2018:i:c:p:547-555. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.