Randomly orthogonal factorizations with constraints in bipartite networks
From MaRDI portal
Publication:1663915
DOI10.1016/j.chaos.2018.04.030zbMath1393.05219OpenAlexW2800111761WikidataQ114199230 ScholiaQ114199230MaRDI QIDQ1663915
Tao Zhang, Hongxia Liu, Si-zhong Zhou
Publication date: 24 August 2018
Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.chaos.2018.04.030
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Randomly \(r\)-orthogonal factorizations in bipartite graphs ⋮ Parameters and fractional factors in different settings ⋮ Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs ⋮ Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Subgraphs with orthogonal factorizations and algorithms
- \((g,f)\)-factorizations orthogonal to a subgraph of a graph
- Room designs and one-factorizations
- Some problems on factorizations with constraints in bipartite graphs
- Randomly orthogonal \((g,f)\)-factorizations in graphs
- Randomly orthogonal factorizations in networks
- Subdigraphs with orthogonal factorizations of digraphs. II
- A polynomial algorithm for finding \((g,f)\)-colorings orthogonal to stars in bipartite graphs
- Remarks on orthogonal factorizations of digraphs
- A sufficient condition for a graph to be an (a, b, k)-critical graph
- Factors and factorizations of graphs—a survey
- A scheduling problem with a simple graphical solution
- Some new perfect Steiner triple systems
- The Structure and Function of Complex Networks
- Orthogonal factorizations of graphs
- Orthogonal \((g,f)\)-factorizations of bipartite graphs
