IDEAS home Printed from https://ideas.repec.org/a/wly/complx/v2022y2022i1n6288054.html

Computation of the Complexity of Networks under Generalized Operations

Author

Listed:
  • Hafiz Usman Afzal
  • Muhammad Javaid
  • Ali Ovais
  • Md Nur Alam

Abstract

The connected and acyclic components contained in a network are identified by the computation of its complexity, where complexity of a network refers to the total number of spanning trees present within. The article in hand deals with the enumeration of the complexity of various networks’ operations such as sum (K2,n + W3, K2,n + nK1, Kn + Sn), product (K2,n⊠K2, K2,n ⋉K2, Kn × K2, Kn⊠K2), difference (K2,n⊖K2), and the conjunction of Sn with K2. All our computations have been concluded by implementation of the methods of linear algebra and matrix theory. Our derivations will also be highlighted with the assistance of 3D plots at the end of this article.

Suggested Citation

  • Hafiz Usman Afzal & Muhammad Javaid & Ali Ovais & Md Nur Alam, 2022. "Computation of the Complexity of Networks under Generalized Operations," Complexity, John Wiley & Sons, vol. 2022(1).
    • Handle: RePEc:wly:complx:v:2022:y:2022:i:1:n:6288054
    DOI: 10.1155/2022/6288054
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2022/6288054
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2022/6288054?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
    ---><---

    References listed on IDEAS

    as
    1. S. N. Daoud, 2013. "Complexity of Products of Some Complete and Complete Bipartite Graphs," Journal of Applied Mathematics, John Wiley & Sons, vol. 2013(1).
    2. S. N. Daoud, 2013. "Complexity of Products of Some Complete and Complete Bipartite Graphs," Journal of Applied Mathematics, Hindawi, vol. 2013, pages 1-25, November.
    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.

      More about this item

      Statistics

      Access and download statistics

      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:wly:complx:v:2022:y:2022:i:1:n:6288054. 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/8503 .

      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.