Randomly orthogonal factorizations with constraints in bipartite networks

Sizhong Zhou, Hongxia Liu and Tao Zhang

Chaos, Solitons & Fractals, 2018, vol. 112, issue C, 31-35

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.

Keywords: Network; Bipartite graph; Subgraph; (g, f)-factor; r-orthogonal factorization (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077918302248
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:112:y:2018:i:c:p:31-35

DOI: 10.1016/j.chaos.2018.04.030

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().