On k-orthogonal factorizations in networks

DOI10.1051/RO/2021037zbMath1468.05240OpenAlexW3139431884WikidataQ114105317 ScholiaQ114105317MaRDI QIDQ5003534

Wei Zhang, Su-fang Wang

Publication date: 22 July 2021

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2021037

zbMATH Keywords

networkfactororthogonal factorization

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (23)

Discussion on fractional \((a, b, k)\)-critical covered graphs ⋮ Discussions on orthogonal factorizations in digraphs ⋮ A Note of Generalization of Fractional ID-factor-critical Graphs ⋮ Component factors and binding number conditions in graphs ⋮ Unnamed Item ⋮ Path factors in subgraphs ⋮ An existence theorem on fractional ID-(g, f)-factor-critical covered graphs ⋮ Some results about ID-path-factor critical graphs ⋮ Path factors and neighborhoods of independent sets in graphs ⋮ Two sufficient conditions for odd \([1,b\)-factors in graphs] ⋮ Two Sufficient Conditions for Graphs to Admit Path Factors ⋮ Degree conditions for the existence of a {P₂, P₅}-factor in a graph ⋮ Sufficient conditions for graphs to have strong parity factors ⋮ Sun toughness and path-factor uniform graphs ⋮ Path-factor critical covered graphs and path-factor uniform graphs ⋮ \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs ⋮ Some sufficient conditions for path-factor uniform graphs ⋮ A result on fractional \((a,b,k)\)-critical covered graphs ⋮ Nash-Williams conditions for the existence of all fractional \([a,b\)-factors] ⋮ Remarks on restricted fractional \((g, f)\)-factors in graphs ⋮ Some results about star-factors in graphs ⋮ A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs ⋮ On \(P_{\geq 3}\)-factor deleted graphs

This page was built for publication: On k-orthogonal factorizations in networks