Randomly orthogonal factorizations with constraints in bipartite networks

DOI10.1016/J.CHAOS.2018.04.030MaRDI QIDQ1663915zbMATH OpenOpenAlexWikidataFDO

Authors Hongxia Liu, Tao Zhang, Sizhong 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

zbMATH Keywords

networkbipartite graphsubgraph\((g,f)\)-factor\(r\)-orthogonal factorization

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Randomly orthogonal factorizations of bipartite graphs
• Randomly \(r\)-orthogonal \((0,f)\)-factorizations of bipartite \((0,mf-(m-1)r)\)-graphs.
• Some problems on factorizations with constraints in bipartite graphs
• Randomly \(r\)-orthogonal factorizations in bipartite graphs
• Orthogonal \((g,f)\)-factorizations of bipartite graphs

Cites work

• scientific article; zbMATH DE number 54787 (Why is no real title available?)
• scientific article; zbMATH DE number 53885 (Why is no real title available?)
• scientific article; zbMATH DE number 3513789 (Why is no real title available?)
• scientific article; zbMATH DE number 979131 (Why is no real title available?)
• scientific article; zbMATH DE number 2044929 (Why is no real title available?)
• scientific article; zbMATH DE number 1555935 (Why is no real title available?)
• A polynomial algorithm for finding \((g,f)\)-colorings orthogonal to stars in bipartite graphs
• A scheduling problem with a simple graphical solution
• A sufficient condition for a graph to be an (a, b, k)-critical graph
• Factors and factorizations of graphs—a survey
• Orthogonal \((g,f)\)-factorizations of bipartite graphs
• Orthogonal factorizations of graphs
• Randomly \(r\)-orthogonal \((0,f)\)-factorizations of bipartite \((0,mf-(m-1)r)\)-graphs.
• Randomly orthogonal (g,f)-factorizations in graphs
• Randomly orthogonal factorizations in networks
• Remarks on orthogonal factorizations of digraphs
• Room designs and one-factorizations
• Some new perfect Steiner triple systems
• Some problems on factorizations with constraints in bipartite graphs
• Subdigraphs with orthogonal factorizations of digraphs. II
• Subgraphs with orthogonal factorizations and algorithms
• The Structure and Function of Complex Networks
• \((g,f)\)-factorizations orthogonal to a subgraph of a graph

Cited in

(4)

• 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
• Parameters and fractional factors in different settings
• Randomly \(r\)-orthogonal factorizations in bipartite graphs

This page was built for publication: Randomly orthogonal factorizations with constraints in bipartite networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1663915)