IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v32y2021i04ns0129183121500509.html
   My bibliography  Save this article

Structural and spectral properties of the generalized corona networks

Author

Listed:
  • R. Rajkumar

    (Department of Mathematics, The Gandhigram Rural Institute (Deemed to be University), Gandhigram 624 302, Tamil Nadu, India)

  • S. Muthuraman

    (Department of Mathematics, The Gandhigram Rural Institute (Deemed to be University), Gandhigram 624 302, Tamil Nadu, India)

Abstract

In this paper, we present a growing complex network model, namely, the generalized corona network (GCN) which is built on a base network and a sequence of networks by using corona product of graphs. This construction generalizes several existing complex network models. We study the structural properties of the special classes of generalized corona networks and show that these networks have small diameter, the cumulative betweenness distribution follows a power-law distribution, the degree distribution decay exponentially, small average path length with the network order, high clustering coefficient and small-world behavior. Further, we obtain the spectra of the adjacency matrix and the signless Laplacian matrix of GCN when the constituting networks are regular. Also, we obtain the Laplacian spectra for all generalized corona networks. In addition, explicitly give eigenvector corresponding to the adjacency and Laplacian eigenvalues. Finally, we derive the spectral radius and the algebraic connectivity of GCN.

Suggested Citation

  • R. Rajkumar & S. Muthuraman, 2021. "Structural and spectral properties of the generalized corona networks," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 32(04), pages 1-30, April.
  • Handle: RePEc:wsi:ijmpcx:v:32:y:2021:i:04:n:s0129183121500509
    DOI: 10.1142/S0129183121500509
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183121500509
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1142/S0129183121500509?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.

    Citations

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


    Cited by:

    1. Raúl M. Falcón & Nagaraj Mohanapriya & Venkitachalam Aparna, 2022. "Optimal Shadow Allocations of Secret Sharing Schemes Arisen from the Dynamic Coloring of Extended Neighborhood Coronas," Mathematics, MDPI, vol. 10(12), pages 1-14, June.

    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:wsi:ijmpcx:v:32:y:2021:i:04:n:s0129183121500509. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    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.