RANDOMLY ORTHOGONAL FACTORIZATIONS OF (0,mf - (m - 1)r)-GRAPHS
From MaRDI portal
Publication:3602133
DOI10.4134/JKMS.2008.45.6.1613zbMATH Open1187.05063OpenAlexW1975639513WikidataQ114021716 ScholiaQ114021716MaRDI QIDQ3602133FDOQ3602133
Authors: Minggang Zong, Sizhong Zhou
Publication date: 12 February 2009
Published in: Journal of the Korean Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4134/jkms.2008.45.6.1613
Recommendations
- Randomly \(r\)-orthogonal \((0,f )\)-factorizations of \((0, mf-m+1)\)-graphs
- \((g, f)\)-factorizations randomly orthogonal to a subgraph in graphs
- Randomly \(r\)-orthogonal \((0,f)\)-factorizations of bipartite \((0,mf-(m-1)r)\)-graphs.
- Randomly orthogonal factorizations of bipartite graphs
- Randomly orthogonal \((g,f)\)-factorizations in graphs
Cited In (8)
- \((g, f)\)-factorizations randomly orthogonal to a subgraph in graphs
- Randomly \(r\)-orthogonal \((0,f )\)-factorizations of \((0, mf-m+1)\)-graphs
- Title not available (Why is that?)
- Randomly \(r\)-orthogonal \((0,f)\)-factorizations of bipartite \((0,mf-(m-1)r)\)-graphs.
- Randomly orthogonal factorizations of bipartite graphs
- Randomly orthogonal \((g,f)\)-factorizations in graphs
- Randomly orthogonal factorizations in networks
- Randomly \(r\)-orthogonal factorizations in bipartite graphs
This page was built for publication: RANDOMLY ORTHOGONAL FACTORIZATIONS OF (0,mf - (m - 1)r)-GRAPHS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602133)