Randomly orthogonal factorizations in networks. (December 2016)

• Record Type: Journal Article
• Authors: Zhou, Sizhong; Xu, Lan; Xu, Yang
• Is Part Of: Chaos, solitons and fractals. Volume 93(2016)
• Page Start: 187
• Page End: 193
• Publication Date: 2016-12
• Subjects: Networks -- Graph -- Subgraph -- (g, f)-factor -- r-orthogonal factorization; 05C70; Chaotic behavior in systems -- Periodicals; Solitons -- Periodicals; Fractals -- Periodicals; Chaotic behavior in systems; Fractals; Solitons; Periodicals; 003.7
• DOI: 10.1016/j.chaos.2016.10.019
• Languages: English
• ISSNs: 0960-0779

Abstract

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 H 1, H 2, …, Hk be k vertex disjoint mr -subgraphs of a graph G . In this paper, we prove that every ( 0, m f − ( m − 1 ) r ) -graph admits a (0, f )-factorization randomly r -orthogonal to each Hi ( i = 1, 2, …, k ).