[0,k_i]_1~m-FACTORIZATIONS ORTHOGONAL TO A SUBGRAPH |
| |
| Authors: | MA Run_nian XU Jin GAO Hang_shan |
| |
| Institution: | 1. Electronic Engineering Research Institute, Xidian University, Xi' an 710071, P R China
2. Department of Engineering Mechanics, Northwestern Polytechnical University, Xi'an 710072, P R China |
| |
| Abstract: | Let G be a graph, k 1 , …, km be positive integers. If the edges of graph G can be in graph Gand | E(H) ∩ E(Fi) | = 1 for all 1 ≤ i ≤ m, then we can call that-F is orwith m edges in G , then graph G has a 0, ki ]1m-factorization orthogonal to H. |
| |
| Keywords: | graph factor factorization orthogonal factorization |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
