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

On BC-Subtrees in Multi-Fan and Multi-Wheel Graphs

Author

Listed:
  • Yu Yang

    (School of Computer Science, Henan Province Key Laboratory of Germplasm Innovation and Utilization of Eco-economic Woody Plant, Pingdingshan University, Pingdingshan 467000, China)

  • Long Li

    (School of Computer Science, Henan Province Key Laboratory of Germplasm Innovation and Utilization of Eco-economic Woody Plant, Pingdingshan University, Pingdingshan 467000, China
    College of Computer Science and Technology, Henan Polytechnic University, Jiaozuo 454003, China)

  • Wenhu Wang

    (School of Computer Science, Henan Province Key Laboratory of Germplasm Innovation and Utilization of Eco-economic Woody Plant, Pingdingshan University, Pingdingshan 467000, China)

  • Hua Wang

    (Department of Mathematical Sciences, Georgia Southern University, Statesboro, GA 30460, USA)

Abstract

The BC-subtree (a subtree in which any two leaves are at even distance apart) number index is the total number of non-empty BC-subtrees of a graph, and is defined as a counting-based topological index that incorporates the leaf distance constraint. In this paper, we provide recursive formulas for computing the BC-subtree generating functions of multi-fan and multi-wheel graphs. As an application, we obtain the BC-subtree numbers of multi-fan graphs, r multi-fan graphs, multi-wheel (wheel) graphs, and discuss the change of the BC-subtree numbers between different multi-fan or multi-wheel graphs. We also consider the behavior of the BC-subtree number in these structures through the study of extremal problems and BC-subtree density. Our study offers a new perspective on understanding new structural properties of cyclic graphs.

Suggested Citation

  • Yu Yang & Long Li & Wenhu Wang & Hua Wang, 2020. "On BC-Subtrees in Multi-Fan and Multi-Wheel Graphs," Mathematics, MDPI, vol. 9(1), pages 1-29, December.
    • Handle: RePEc:gam:jmathe:v:9:y:2020:i:1:p:36-:d:468403
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Chen, Xufeng & Zhang, Jingyuan & Sun, Weigang, 2017. "On the Hosoya index of a family of deterministic recursive trees," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 449-453.
    2. Lin, Wenshui & Chen, Jianfeng & Wu, Zhixi & Dimitrov, Darko & Huang, Linshan, 2018. "Computer search for large trees with minimal ABC index," Applied Mathematics and Computation, Elsevier, vol. 338(C), pages 221-230.
    3. Sun, Qiang & Ikica, Barbara & Škrekovski, Riste & Vukašinović, Vida, 2019. "Graphs with a given diameter that maximise the Wiener index," Applied Mathematics and Computation, Elsevier, vol. 356(C), pages 438-448.
    4. Benjamin Allen & Gabor Lippner & Yu-Ting Chen & Babak Fotouhi & Naghmeh Momeni & Shing-Tung Yau & Martin A. Nowak, 2017. "Evolutionary dynamics on any population structure," Nature, Nature, vol. 544(7649), pages 227-230, April.
    5. Dale R. Fox, 1988. "Block cutpoint decomposition for markovian queueing systems," Applied Stochastic Models and Data Analysis, John Wiley & Sons, vol. 4(2), pages 101-114, June.
    6. Milovanović, E.I. & Milovanović, I.Ž. & Matejić, M.M., 2018. "Remark on spectral study of the geometric–arithmetic index and some generalizations," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 206-213.
    7. Tu, Jianhua & Zhou, Yukang & Su, Guifu, 2017. "A kind of conditional connectivity of Cayley graphs generated by wheel graphs," Applied Mathematics and Computation, Elsevier, vol. 301(C), pages 177-186.
    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. Yu Yang & An Wang & Hua Wang & Wei-Ting Zhao & Dao-Qiang Sun, 2019. "On Subtrees of Fan Graphs, Wheel Graphs, and “Partitions” of Wheel Graphs under Dynamic Evolution," Mathematics, MDPI, vol. 7(5), pages 1-19, May.
    2. M. Kleshnina & K. Kaveh & K. Chatterjee, 2020. "The role of behavioural plasticity in finite vs infinite populations," Papers 2009.13160, arXiv.org.
    3. Michael Foley & Rory Smead & Patrick Forber & Christoph Riedl, 2021. "Avoiding the bullies: The resilience of cooperation among unequals," PLOS Computational Biology, Public Library of Science, vol. 17(4), pages 1-18, April.
    4. Li, Wen-Jing & Chen, Zhi & Jin, Ke-Zhong & Li, Lan & Yuan, Lin & Jiang, Luo-Luo & Perc, Matjaž & Kurths, Jürgen, 2022. "Eliminating poverty through social mobility promotes cooperation in social dilemmas," Chaos, Solitons & Fractals, Elsevier, vol. 156(C).
    5. Lv, Shaojie & Song, Feifei, 2022. "Particle swarm intelligence and the evolution of cooperation in the spatial public goods game with punishment," Applied Mathematics and Computation, Elsevier, vol. 412(C).
    6. Benjamin Allen & Christine Sample & Robert Jencks & James Withers & Patricia Steinhagen & Lori Brizuela & Joshua Kolodny & Darren Parke & Gabor Lippner & Yulia A Dementieva, 2020. "Transient amplifiers of selection and reducers of fixation for death-Birth updating on graphs," PLOS Computational Biology, Public Library of Science, vol. 16(1), pages 1-20, January.
    7. Fulin Guo, 2023. "Experience-weighted attraction learning in network coordination games," Papers 2310.18835, arXiv.org.
    8. Xu Chen & Xuan Di & Zechu Li, 2023. "Social Learning for Sequential Driving Dilemmas," Games, MDPI, vol. 14(3), pages 1-12, May.
    9. Bin Wu & Lei Zhou, 2018. "Individualised aspiration dynamics: Calculation by proofs," PLOS Computational Biology, Public Library of Science, vol. 14(9), pages 1-15, September.
    10. Quan, Ji & Chen, Xinyue & Wang, Xianjia, 2024. "Repeated prisoner's dilemma games in multi-player structured populations with crosstalk," Applied Mathematics and Computation, Elsevier, vol. 473(C).
    11. McAvoy, Alex & Fraiman, Nicolas & Hauert, Christoph & Wakeley, John & Nowak, Martin A., 2018. "Public goods games in populations with fluctuating size," Theoretical Population Biology, Elsevier, vol. 121(C), pages 72-84.
    12. da Silva Rocha, André Barreira & Salomão, Gabriel Meyer, 2019. "Environmental policy regulation and corporate compliance in evolutionary game models with well-mixed and structured populations," European Journal of Operational Research, Elsevier, vol. 279(2), pages 486-501.
    13. Chen, Xiaodan & Li, Xiuyu & Lin, Wenshui, 2021. "On connected graphs and trees with maximal inverse sum indeg index," Applied Mathematics and Computation, Elsevier, vol. 392(C).
    14. Tatsuya Sasaki & Satoshi Uchida & Isamu Okada & Hitoshi Yamamoto, 2024. "The Evolution of Cooperation and Diversity under Integrated Indirect Reciprocity," Games, MDPI, vol. 15(2), pages 1-16, April.
    15. Liu, Xuesong & Pan, Qiuhui & He, Mingfeng & Liu, Aizhi, 2019. "Promotion of cooperation in evolutionary game dynamics under asymmetric information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 521(C), pages 258-266.
    16. Song, Fanpeng & Wu, Jianliang & Fan, Suohai & Jing, Fei, 2020. "Transcendental behavior and disturbance behavior favor human development," Applied Mathematics and Computation, Elsevier, vol. 378(C).
    17. Hu, Xiaomin & Tian, Yingzhi & Meng, Jixiang, 2018. "Super Rk-vertex-connectedness," Applied Mathematics and Computation, Elsevier, vol. 339(C), pages 812-819.
    18. Christopher Graser & Takako Fujiwara-Greve & Julian García & Matthijs van Veelen, 2024. "Repeated games with partner choice," Tinbergen Institute Discussion Papers 24-038/I, Tinbergen Institute.
    19. Thomas Graham & Maria Kleshnina & Jerzy A. Filar, 2023. "Where Do Mistakes Lead? A Survey of Games with Incompetent Players," Dynamic Games and Applications, Springer, vol. 13(1), pages 231-264, March.
    20. Shiro Horiuchi, 2021. "Bridging of different sites by bohemians and tourists: analysis by agent-based simulation," Journal of Computational Social Science, Springer, vol. 4(2), pages 567-584, 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:9:y:2020:i:1:p:36-:d:468403. 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.