On Mutually Orthogonal Disjoint Copies of Graph Squares
收藏DataCite Commons2020-09-18 更新2025-04-16 收录
下载链接：
http://siba-ese.unile.it/index.php/notemat/article/view/16631/14289
下载链接
链接失效反馈官方服务：
资源简介：
A family of decompositions {G0,G1, ...,Gk−1} of a complete bipartite graph Kn,n is a set of k mutually orthogonal graph squares (M OGS) if Gi and Gj are orthogonal for all i, j∈ {0,1, ..., k−1} and i6=j. For any subgraph G of Kn,n with n edges, N(n, G) denotes the maximum number k in a largest possible set {G0,G1, ...,Gk−1}of (M OGS) of Kn,n by G.Our objective of this paper is to compute N(n, G) =k≥3 where G represents disjoint copies of certain subgraphs of Kn,n.
提供机构：
University of Salento
创建时间：
2017-01-31
