Back to Search
Start Over
Randomly orthogonal factorizations in networks
- Source :
- Chaos, Solitons & Fractals. 93:187-193
- Publication Year :
- 2016
- Publisher :
- Elsevier BV, 2016.
-
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 , m f − ( m − 1 ) r ) -graph admits a (0, f)-factorization randomly r-orthogonal to each Hi ( i = 1 , 2 , … , k ).
- Subjects :
- Discrete mathematics
Vertex (graph theory)
General Mathematics
Applied Mathematics
010102 general mathematics
General Physics and Astronomy
Statistical and Nonlinear Physics
0102 computer and information sciences
Disjoint sets
01 natural sciences
Graph
Combinatorics
010201 computation theory & mathematics
Bound graph
0101 mathematics
Mathematics
Subjects
Details
- ISSN :
- 09600779
- Volume :
- 93
- Database :
- OpenAIRE
- Journal :
- Chaos, Solitons & Fractals
- Accession number :
- edsair.doi...........6f7c4a2bdac86005c454c1c0e56ea0b2