IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v112y2018icp31-35.html
   My bibliography  Save this article

Randomly orthogonal factorizations with constraints in bipartite networks

Author

Listed:
  • Zhou, Sizhong
  • Liu, Hongxia
  • Zhang, Tao

Abstract

Many problems on computer science, chemistry, physics and network theory are related to factors, factorizations and orthogonal factorizations in graphs. For example, the telephone network design problems can be converted into maximum matchings of graphs; perfect matchings or 1-factors in graphs correspond to Kekulé structures in chemistry; the file transfer problems in computer networks can be modelled as (0, f)-factorizations in graphs; the designs of Latin squares and Room squares are related to orthogonal factorizations in graphs; the orthogonal (g, f)-colorings of graphs are related to orthogonal (g, f)-factorizations of graphs. In this paper, the orthogonal factorizations in graphs are discussed and we show that every bipartite (0,mf−(m−1)r)-graph G has a (0, f)-factorization randomly r-orthogonal to n vertex disjoint mr-subgraphs of G in certain conditions.

Suggested Citation

  • Zhou, Sizhong & Liu, Hongxia & Zhang, Tao, 2018. "Randomly orthogonal factorizations with constraints in bipartite networks," Chaos, Solitons & Fractals, Elsevier, vol. 112(C), pages 31-35.
    • Handle: RePEc:eee:chsofr:v:112:y:2018:i:c:p:31-35
    DOI: 10.1016/j.chaos.2018.04.030
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077918302248
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2018.04.030?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. Zhou, Sizhong & Xu, Lan & Xu, Yang, 2016. "Randomly orthogonal factorizations in networks," Chaos, Solitons & Fractals, Elsevier, vol. 93(C), pages 187-193.
    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.

      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:chsofr:v:112:y:2018:i:c:p:31-35. 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: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

      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.