Randomly orthogonal factorizations with constraints in bipartite networks

DOI10.1016/J.CHAOS.2018.04.030zbMATH Open1393.05219OpenAlexW2800111761WikidataQ114199230 ScholiaQ114199230MaRDI QIDQ1663915FDOQ1663915

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

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

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)

Cites Work

• The Structure and Function of Complex Networks
• Factors and factorizations of graphs—a survey
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some new perfect Steiner triple systems
• \((g,f)\)-factorizations orthogonal to a subgraph of a graph
• Orthogonal factorizations of graphs
• Subgraphs with orthogonal factorizations and algorithms
• A sufficient condition for a graph to be an (a, b, k)-critical graph
• Room designs and one-factorizations
• Some problems on factorizations with constraints in bipartite graphs
• Orthogonal \((g,f)\)-factorizations of bipartite graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Randomly \(r\)-orthogonal \((0,f)\)-factorizations of bipartite \((0,mf-(m-1)r)\)-graphs.
• A scheduling problem with a simple graphical solution
• Title not available (Why is that?)

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)