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

Counting spanning hypertrees in non-uniform hypergraphs based on sum operation

Author

Listed:
  • Ke Zhang

    (School of Information Engineering, Huzhou University, Huzhou 313000, Zhejiang, P. R. China)

  • Jiachun Guo

    (��School of Humanities, Huzhou College, Huzhou 313000, Zhejiang, P. R. China)

  • Lixin Dong

    (��School of Computer, Qinghai Normal University, Xining 810800, P. R. China)

  • Hongwei Yin

    (School of Information Engineering, Huzhou University, Huzhou 313000, Zhejiang, P. R. China)

Abstract

The theoretical and applied research on hypergraph or hypernetwork is one of the hot topics of system science. Spanning hypertree extended from spanning tree is an interesting problem about this topic, but determining the number of spanning hypertrees in general hypergraphs is not suitable for generalizing from graph and more intractable. In this paper, we propose a definition of spanning hypertree which has less constraints than the traditional definition of spanning hypertree, and then find exact analytical expressions for the number of spanning hypertrees in several kinds of non-uniform hypergraphs based on sum operation. In addition, we define the entropy of spanning hypertree and conduct data experiments on the entropies of spanning hypertrees in four special classes of non-uniform hypergraphs.

Suggested Citation

  • Ke Zhang & Jiachun Guo & Lixin Dong & Hongwei Yin, 2024. "Counting spanning hypertrees in non-uniform hypergraphs based on sum operation," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 35(04), pages 1-15, April.
    • Handle: RePEc:wsi:ijmpcx:v:35:y:2024:i:04:n:s0129183124500426
    DOI: 10.1142/S0129183124500426
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183124500426
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183124500426?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.

    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:35:y:2024:i:04:n:s0129183124500426. 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.