IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v540y2020ics0378437119317352.html
   My bibliography  Save this article

On the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networks

Author

Listed:
  • Liu, Jia-Bao
  • Zhao, Jing
  • Cai, Zheng-Qun

Abstract

Many problems in real world, either natural or man-made, can be usefully represented by graphs or networks. Along with a complex topological structure, the weight is a vital factor in characterizing some properties of real networks. In this paper, we define a class of the weighted edge corona product networks. The generalized adjacency (resp., Laplacian and signless Laplacian) spectra with two different structures are determined. As applications, the number of spanning trees and Kirchhoff index of the weighted edge corona product networks are computed.

Suggested Citation

  • Liu, Jia-Bao & Zhao, Jing & Cai, Zheng-Qun, 2020. "On the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 540(C).
    • Handle: RePEc:eee:phsmap:v:540:y:2020:i:c:s0378437119317352
    DOI: 10.1016/j.physa.2019.123073
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437119317352
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2019.123073?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. Dai, Meifeng & Liu, Jingyi & Chang, Jianwei & Tang, Donglei & Ju, Tingting & Sun, Yu & Su, Weiyi, 2019. "Eigentime identity of the weighted scale-free triangulation networks for weight-dependent walk," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 513(C), pages 202-209.
    2. Meifeng Dai & Yufei Chen & Xiaoqian Wang & Weiyi Su, 2018. "Spectral analysis for weighted iterated quadrilateral graphs," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 29(11), pages 1-20, November.
    3. Huang, Jing & Li, Shuchao & Li, Xuechao, 2016. "The normalized Laplacian, degree-Kirchhoff index and spanning trees of the linear polyomino chains," Applied Mathematics and Computation, Elsevier, vol. 289(C), pages 324-334.
    4. Dai, Meifeng & Shao, Shuxiang & Su, Weiyi & Xi, Lifeng & Sun, Yanqiu, 2017. "The modified box dimension and average weighted receiving time of the weighted hierarchical graph," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 475(C), pages 46-58.
    5. Liu, Jia-Bao & Pan, Xiang-Feng, 2016. "Minimizing Kirchhoff index among graphs with a given vertex bipartiteness," Applied Mathematics and Computation, Elsevier, vol. 291(C), pages 84-88.
    6. Dai, Meifeng & Shen, Junjie & Dai, Lingfei & Ju, Tingting & Hou, Yongbo & Su, Weiyi, 2019. "Generalized adjacency and Laplacian spectra of the weighted corona graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 528(C).
    7. Ma, Fei & Yao, Bing, 2017. "The relations between network-operation and topological-property in a scale-free and small-world network with community structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 484(C), pages 182-193.
    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. Mahanta, Abhigyan & Gogoi, Idweep Jyoti & Bharali, A., 2021. "A note on the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 581(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. Huang, Guixian & He, Weihua & Tan, Yuanyao, 2019. "Theoretical and computational methods to minimize Kirchhoff index of graphs with a given edge k-partiteness," Applied Mathematics and Computation, Elsevier, vol. 341(C), pages 348-357.
    2. Fei, Junqi & Tu, Jianhua, 2018. "Complete characterization of bicyclic graphs with the maximum and second-maximum degree Kirchhoff index," Applied Mathematics and Computation, Elsevier, vol. 330(C), pages 118-124.
    3. Dai, Meifeng & Dai, Changxi & Ju, Tingting & Shen, Junjie & Sun, Yu & Su, Weiyi, 2019. "Mean first-passage times for two biased walks on the weighted rose networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 268-278.
    4. Hong, Yunchao & Zhu, Zhongxun & Luo, Amu, 2018. "Some transformations on multiplicative eccentricity resistance-distance and their applications," Applied Mathematics and Computation, Elsevier, vol. 323(C), pages 75-85.
    5. Faxu Li & Hui Xu & Liang Wei & Defang Wang, 2023. "RETRACTED ARTICLE: Identifying vital nodes in hypernetwork based on local centrality," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-13, January.
    6. Wenyu Shi & Qiang Tang, 2023. "RETRACTED ARTICLE: Cost-optimized data placement strategy for social network with security awareness in edge-cloud computing environment," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-15, January.
    7. Li Zhang & Jing Zhao & Jia-Bao Liu & Salama Nagy Daoud, 2019. "Resistance Distance in the Double Corona Based on R -Graph," Mathematics, MDPI, vol. 7(1), pages 1-13, January.
    8. Sajjad, Wasim & Sardar, Muhammad Shoaib & Pan, Xiang-Feng, 2024. "Computation of resistance distance and Kirchhoff index of chain of triangular bipyramid hexahedron," Applied Mathematics and Computation, Elsevier, vol. 461(C).
    9. He, Weihua & Li, Hao & Xiao, Shuofa, 2017. "On the minimum Kirchhoff index of graphs with a given vertex k-partiteness and edge k-partiteness," Applied Mathematics and Computation, Elsevier, vol. 315(C), pages 313-318.
    10. Ma, Xiaoling & Bian, Hong, 2019. "The normalized Laplacians, degree-Kirchhoff index and the spanning trees of hexagonal Möbius graphs," Applied Mathematics and Computation, Elsevier, vol. 355(C), pages 33-46.
    11. Li, Zhemin & Xie, Zheng & Li, Jianping & Pan, Yingui, 2020. "Resistance distance-based graph invariants and spanning trees of graphs derived from the strong prism of a star," Applied Mathematics and Computation, Elsevier, vol. 382(C).
    12. Li, Deqiong & Hou, Yaoping, 2017. "The normalized Laplacian spectrum of quadrilateral graphs and its applications," Applied Mathematics and Computation, Elsevier, vol. 297(C), pages 180-188.
    13. Fang Gao & Xiaoxin Li & Kai Zhou & Jia-Bao Liu, 2018. "The Extremal Graphs of Some Topological Indices with Given Vertex k -Partiteness," Mathematics, MDPI, vol. 6(11), pages 1-11, November.
    14. Huang, Jing & Li, Shuchao, 2018. "The normalized Laplacians on both k-triangle graph and k-quadrilateral graph with their applications," Applied Mathematics and Computation, Elsevier, vol. 320(C), pages 213-225.
    15. Li, Danyi & Yan, Weigen, 2023. "Counting spanning trees with a Kekulé structure in linear hexagonal chains," Applied Mathematics and Computation, Elsevier, vol. 456(C).
    16. Jia Wei & Jing Wang, 2022. "Spectra of Complemented Triangulation Graphs," Mathematics, MDPI, vol. 10(17), pages 1-9, September.
    17. Li Zhang & Jing Zhao & Jia-Bao Liu & Micheal Arockiaraj, 2018. "Resistance Distance in H -Join of Graphs G 1 , G 2 , … , G k," Mathematics, MDPI, vol. 6(12), pages 1-10, November.
    18. Yang, Yujun & Cao, Yuliang & Yao, Haiyuan & Li, Jing, 2018. "Solution to a conjecture on a Nordhaus–Gaddum type result for the Kirchhoff index," Applied Mathematics and Computation, Elsevier, vol. 332(C), pages 241-249.
    19. Jia-Bao Liu & Jing Zhao & Zhongxun Zhu & Jinde Cao, 2019. "On the Normalized Laplacian and the Number of Spanning Trees of Linear Heptagonal Networks," Mathematics, MDPI, vol. 7(4), pages 1-15, March.
    20. Dai, Meifeng & Wang, Xiaoqian & Sun, Yanqiu & Sun, Yu & Su, Weiyi, 2017. "Eigentime identities for random walks on a family of treelike networks and polymer networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 484(C), pages 132-140.

    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:phsmap:v:540:y:2020:i:c:s0378437119317352. 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: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.