Randomly orthogonal factorizations in networks

Sizhong Zhou, Lan Xu and Yang Xu

Chaos, Solitons & Fractals, 2016, vol. 93, issue C, 187-193

Abstract: Let m, r, k be three positive integers. Let G be a graph with vertex set V(G) and edge set E(G), and let f: V(G) → N be a function such that f(x)≥(k+2)r−1 for any x ∈ V(G). Let H1, H2, …, Hk be k vertex disjoint mr-subgraphs of a graph G. In this paper, we prove that every (0,mf−(m−1)r)-graph admits a (0, f)-factorization randomly r-orthogonal to each Hi (i=1,2,…,k).

Keywords: Networks; Graph; Subgraph; (g, f)-factor; r-orthogonal factorization (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077916303216
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:93:y:2016:i:c:p:187-193

DOI: 10.1016/j.chaos.2016.10.019

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. ().