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

A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration

Author

Listed:
  • Lang, Rongling
  • Li, Tao
  • Mo, Desen
  • Shi, Yongtang

Abstract

A novel method for analyzing the inverse problem of topological indices of graph is proposed in this paper, which applies the data mining technique to classification of graphs according to topological indices. Differing from the way of using topological indices to categorize graphs into different isomorphic classes, this method aims at dividing molecular graphs with n vertices into several compact classes according to their topological indices. Then the chemical and physical features of each kind of graph can be researched and new compounds can be found, which has great significance on bio-medical filed. In the experiment, three classes of simple connected graphs with 5, 6 and 7 vertices, respectively, are investigated and analyzed using the proposed method, the experimental results show the validity of it. However, there are still some problems needed to be researched further, such as selecting the vector of topological indices for clustering, selecting the distance between the vectors of topological indices, choosing the aspects to analyze the properties of each kind of graph after clustering, etc.

Suggested Citation

  • Lang, Rongling & Li, Tao & Mo, Desen & Shi, Yongtang, 2016. "A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration," Applied Mathematics and Computation, Elsevier, vol. 291(C), pages 115-121.
    • Handle: RePEc:eee:apmaco:v:291:y:2016:i:c:p:115-121
    DOI: 10.1016/j.amc.2016.06.048
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300316304283
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2016.06.048?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 & Shi, Yongtang & Mowshowitz, Abbe, 2015. "Discrimination power of graph measures based on complex zeros of the partial Hosoya polynomial," Applied Mathematics and Computation, Elsevier, vol. 250(C), pages 352-355.
    2. Yu, Guihai & Qu, Hui, 2015. "Hermitian Laplacian matrix and positive of mixed graphs," Applied Mathematics and Computation, Elsevier, vol. 269(C), pages 70-76.
    3. Yu, Guihai & Qu, Hui & Tu, Jianhua, 2015. "Inertia of complex unit gain graphs," Applied Mathematics and Computation, Elsevier, vol. 265(C), pages 619-629.
    4. Zhenhua Pei & Baokui Wang & Jinming Du, 2016. "Effects of income redistribution on the evolution of cooperation in spatial public goods games," Papers 1611.01531, arXiv.org.
    5. Qu, Hui & Yu, Guihai, 2015. "Bicyclic oriented graphs with skew-rank 2 or 4," Applied Mathematics and Computation, Elsevier, vol. 258(C), pages 182-191.
    6. Matthias Dehmer & Frank Emmert-Streib & Yongtang Shi & Monica Stefu & Shailesh Tripathi, 2015. "Discrimination Power of Polynomial-Based Descriptors for Graphs by Using Functional Matrices," PLOS ONE, Public Library of Science, vol. 10(10), pages 1-10, October.
    7. Ding, Shuai & Wang, Juan & Ruan, Sumei & Xia, Chengyi, 2015. "Inferring to individual diversity promotes the cooperation in the spatial prisoner’s dilemma game," Chaos, Solitons & Fractals, Elsevier, vol. 71(C), pages 91-99.
    8. Matthias Dehmer & Abbe Mowshowitz & Yongtang Shi, 2014. "Structural Differentiation of Graphs Using Hosoya-Based Indices," PLOS ONE, Public Library of Science, vol. 9(7), pages 1-4, July.
    9. Dehmer, M. & Moosbrugger, M. & Shi, Y., 2015. "Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix," Applied Mathematics and Computation, Elsevier, vol. 268(C), pages 164-168.
    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. Cao, Shujuan & Dehmer, Matthias & Kang, Zhe, 2017. "Network Entropies Based on Independent Sets and Matchings," Applied Mathematics and Computation, Elsevier, vol. 307(C), pages 265-270.
    2. Ji, Shengjin & Liu, Mengmeng & Wu, Jianliang, 2018. "A lower bound of revised Szeged index of bicyclic graphs," Applied Mathematics and Computation, Elsevier, vol. 316(C), pages 480-487.
    3. Goubko, Mikhail, 2018. "Maximizing Wiener index for trees with given vertex weight and degree sequences," Applied Mathematics and Computation, Elsevier, vol. 316(C), pages 102-114.
    4. Yu, Guihai & Liu, Xin & Qu, Hui, 2017. "Singularity of Hermitian (quasi-)Laplacian matrix of mixed graphs," Applied Mathematics and Computation, Elsevier, vol. 293(C), pages 287-292.
    5. Li, Fengwei & Ye, Qingfang & Sun, Yuefang, 2017. "On edge-rupture degree of graphs," Applied Mathematics and Computation, Elsevier, vol. 292(C), pages 282-293.
    6. Guihai Yu & Hui Qu, 2018. "More on Spectral Analysis of Signed Networks," Complexity, Hindawi, vol. 2018, pages 1-6, October.

    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. Deng, Zheng-Hong & Huang, Yi-Jie & Gu, Zhi-Yang & Li-Gao,, 2018. "Multigames with social punishment and the evolution of cooperation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 505(C), pages 164-170.
    2. Yong Lu & Ligong Wang & Qiannan Zhou, 2019. "The rank of a complex unit gain graph in terms of the rank of its underlying graph," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 570-588, August.
    3. Zhou, Tianwei & Ding, Shuai & Fan, Wenjuan & Wang, Hao, 2016. "An improved public goods game model with reputation effect on the spatial lattices," Chaos, Solitons & Fractals, Elsevier, vol. 93(C), pages 130-135.
    4. Geng, Yini & Shen, Chen & Hu, Kaipeng & Shi, Lei, 2018. "Impact of punishment on the evolution of cooperation in spatial prisoner’s dilemma game," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 503(C), pages 540-545.
    5. 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).
    6. Shen, Chen & Li, Xiaoping & Shi, Lei & Deng, Zhenghong, 2017. "Asymmetric evaluation promotes cooperation in network population," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 474(C), pages 391-397.
    7. Yang, Xuenan & Peng, Yu & Xiao, Yue & Wu, Xue, 2019. "Nonlinear dynamics of a duopoly Stackelberg game with marginal costs," Chaos, Solitons & Fractals, Elsevier, vol. 123(C), pages 185-191.
    8. Zhao, Shuang & Zhang, Heping, 2016. "Forcing polynomials of benzenoid parallelogram and its related benzenoids," Applied Mathematics and Computation, Elsevier, vol. 284(C), pages 209-218.
    9. Bahbouhi, Jalal Eddine & Moussa, Najem, 2019. "A graph-based model for public goods with leaderships," Applied Mathematics and Computation, Elsevier, vol. 349(C), pages 53-61.
    10. Dehmer, Matthias & Chen, Zengqiang & Shi, Yongtang & Zhang, Yusen & Tripathi, Shailesh & Ghorbani, Modjtaba & Mowshowitz, Abbe & Emmert-Streib, Frank, 2019. "On efficient network similarity measures," Applied Mathematics and Computation, Elsevier, vol. 362(C), pages 1-1.
    11. Rense Corten & Stephanie Rosenkranz & Vincent Buskens & Karen S Cook, 2016. "Reputation Effects in Social Networks Do Not Promote Cooperation: An Experimental Test of the Raub & Weesie Model," PLOS ONE, Public Library of Science, vol. 11(7), pages 1-17, July.
    12. Liu, Chen & Guo, Hao & Li, Zhibin & Gao, Xiaoyuan & Li, Shudong, 2019. "Coevolution of multi-game resolves social dilemma in network population," Applied Mathematics and Computation, Elsevier, vol. 341(C), pages 402-407.
    13. Dehghani, Sedigheh & Nazarimehr, Fahimeh & Jafari, Sajad, 2021. "How can cultural conditions affect society’s decisions?," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 582(C).
    14. Chang, Shuhua & Zhang, Zhipeng & Wu, Yu’e & Xie, Yunya, 2018. "Cooperation is enhanced by inhomogeneous inertia in spatial prisoner’s dilemma game," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 490(C), pages 419-425.
    15. Liu, Yandi & Wang, Hexin & Ding, Yi & Yang, Xuan & Dai, Yu, 2022. "Can weak diversity help in propagating cooperation? Invasion of cooperators at the conformity-conflict boundary," Chaos, Solitons & Fractals, Elsevier, vol. 156(C).
    16. Kurokawa, Shun, 2019. "How memory cost, switching cost, and payoff non-linearity affect the evolution of persistence," Applied Mathematics and Computation, Elsevier, vol. 341(C), pages 174-192.
    17. Matthias Dehmer & Frank Emmert-Streib & Yongtang Shi & Monica Stefu & Shailesh Tripathi, 2015. "Discrimination Power of Polynomial-Based Descriptors for Graphs by Using Functional Matrices," PLOS ONE, Public Library of Science, vol. 10(10), pages 1-10, October.
    18. Chen, Qiao & Chen, Tong & Wang, Yongjie, 2017. "Publishing the donation list incompletely promotes the emergence of cooperation in public goods game," Applied Mathematics and Computation, Elsevier, vol. 310(C), pages 48-56.
    19. Jin, Jiahua & Chu, Chen & Shen, Chen & Guo, Hao & Geng, Yini & Jia, Danyang & Shi, Lei, 2018. "Heterogeneous fitness promotes cooperation in the spatial prisoner's dilemma game," Chaos, Solitons & Fractals, Elsevier, vol. 106(C), pages 141-146.
    20. Jinling Yang & Ligong Wang & Xiuwen Yang, 2021. "Some mixed graphs with H-rank 4, 6 or 8," Journal of Combinatorial Optimization, Springer, vol. 41(3), pages 678-693, April.

    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:291:y:2016:i:c:p:115-121. 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.