Results 221 to 230 of about 153,964 (249)
Some of the next articles are maybe not open access.
Decomposition of complete graphs into isomorphic complete bipartite graphs
2013Summary: A decomposition of a complete graph \(K\) into disjoint copies of a complete bipartite graph \(K_{s,t}\) is called a \(K_{s,t}\)-design of order \(n\). The existence problem of \(K_{s,t}\)-designs has been completely solved for the graphs \(K_{1,t}\) for \(k\geq 1\), \(K_{2^{a},2^{b}}\) for \(a,b\geq 1\), \(K_{2, 3}\) and \(K_{3, 3}\). In this
openaire +2 more sources
Bipartite graphs and completely 0-simple semigroups
Semigroup Forum, 2011With any completely 0-simple semigroup \(S\), represented as a Rees matrix semigroup \(\mathcal M^0(I,G,\Lambda,P)\), the author associates the bipartite graph \(\Gamma(S)\), the vertex set of which is \(I\cup\Lambda\), the edge set consisting of the pairs \((i,\lambda)\) for which \(p_{\lambda i}\neq 0\).
openaire +2 more sources
Effective resistances and spanning trees in the complete bipartite graph plus a matching
Discrete Applied Mathematics, 2021Jun Ge
exaly
Counting spanning trees in a complete bipartite graph which contain a given spanning forest
Journal of Graph Theory, 2022Fengming Dong, Jun Ge
exaly
Tensorized Bipartite Graph Learning for Multi-View Clustering
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2023Wei Xia, Quanxue Gao, Qianqian Wang
exaly
On the thickness of the complete bipartite graph
Mathematical Proceedings of the Cambridge Philosophical Society, 1964L. Beineke, F. Harary, J. Moon
semanticscholar +1 more source
Topological Indices of the Line Graph of Subdivision Graph of Complete Bipartite Graphs
, 2017A. Aslam +3 more
semanticscholar +1 more source
Thep-intersection number of a complete bipartite graph and orthogonal double coverings of a clique
Comb., 1994M. Chung, D. West
semanticscholar +1 more source
sāRegular cubic graphs as coverings of the complete bipartite graph K3,3
Journal of Graph Theory, 2004Yan-Quan Feng, J. Kwak
semanticscholar +1 more source

