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

Orbit Entropy and Symmetry Index Revisited

Author

Listed:
  • Maryam Jalali-Rad

    (Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training University, Tehran 16785-136, Iran)

  • Modjtaba Ghorbani

    (Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training University, Tehran 16785-136, Iran)

  • Matthias Dehmer

    (Department of Computer Science, Swiss Distance University of Applied Sciences, 3900 Brig, Switzerland
    Department of Biomedical Computer Science and Mechatronics, UMIT, 6060 Hall in Tyrol, Austria
    College of Artificial Intelligence, Nankai University, Tianjin 300350, China)

  • Frank Emmert-Streib

    (Predictive Society and Data Analytics Lab, Tampere University, Tampere, Korkeakoulunkatu 10, 33720 Tampere, Finland
    Institute of Biosciences and Medical Technology, Tampere University, Tampere, Korkeakoulunkatu 10, 33720 Tampere, Finland)

Abstract

The size of the orbits or similar vertices of a network provides important information regarding each individual component of the network. In this paper, we investigate the entropy or information content and the symmetry index for several classes of graphs and compare the values of this measure with that of the symmetry index of certain graphs.

Suggested Citation

  • 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.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:10:p:1086-:d:552771
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/10/1086/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/10/1086/
    Download Restriction: no
    ---><---

    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. 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.
    3. 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.
    4. 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.
    5. Ma, Fei & Yao, Bing, 2018. "A family of small-world network models built by complete graph and iteration-function," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 492(C), pages 2205-2219.
    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. Ghorbani, Modjtaba & Alidehi-Ravandi, Razie & Dehmer, Matthias, 2024. "Fullerenes via their counting polynomials," Applied Mathematics and Computation, Elsevier, vol. 466(C).

    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. 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. 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).
    3. Liu, Zhixue & Ding, Ronggui & Wang, Lei & Song, Rui & Song, Xinyi, 2023. "Cooperation in an uncertain environment: The impact of stakeholders' concerted action on collaborative innovation projects risk management," Technological Forecasting and Social Change, Elsevier, vol. 196(C).
    4. Modjtaba Ghorbani & Razie Alidehi-Ravandi & Matthias Dehmer & Frank Emmert-Streib, 2023. "A Study of Roots of a Certain Class of Counting Polynomials," Mathematics, MDPI, vol. 11(13), pages 1-14, June.
    5. Ghorbani, Modjtaba & Alidehi-Ravandi, Razie & Dehmer, Matthias, 2024. "Fullerenes via their counting polynomials," Applied Mathematics and Computation, Elsevier, vol. 466(C).
    6. 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.
    7. Yu, Guihai & Li, Xingfu, 2020. "Connective Steiner 3-eccentricity index and network similarity measure," Applied Mathematics and Computation, Elsevier, vol. 386(C).
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. Knor, Martin & Škrekovski, Riste & Tepeh, Aleksandra, 2016. "Digraphs with large maximum Wiener index," Applied Mathematics and Computation, Elsevier, vol. 284(C), pages 260-267.

    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:9:y:2021:i:10:p:1086-:d:552771. 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.