Journal of the Korean Mathematical Society (대한수학회지)

Korean Mathematical Society (대한수학회)
권호 표지
DOI QR코드

DOI QR Code

RANDOMLY ORTHOGONAL FACTORIZATIONS OF (0,mf - (m - 1)r)-GRAPHS

  • Zhou, Sizhong (SCHOOL OF MATHEMATICS AND PHYSICS JIANGSU UNIVERSITY OF SCIENCE AND TECHNOLOGY) ;
  • Zong, Minggang (FACULTY OF SCIENCES JIANGSU UNIVERSITY)
  • Published : 2008.11.01
Download PDF
⟨ Previous Next ⟩

Abstract

Let G be a graph with vertex set V(G) and edge set E(G), and let g, f be two nonnegative integer-valued functions defined on V(G) such that $g(x)\;{\leq}\;f(x)$ for every vertex x of V(G). We use $d_G(x)$ to denote the degree of a vertex x of G. A (g, f)-factor of G is a spanning subgraph F of G such that $g(x)\;{\leq}\;d_F(x)\;{\leq}\;f(x)$ for every vertex x of V(F). In particular, G is called a (g, f)-graph if G itself is a (g, f)-factor. A (g, f)-factorization of G is a partition of E(G) into edge-disjoint (g, f)-factors. Let F = {$F_1$, $F_2$, ..., $F_m$} be a factorization of G and H be a subgraph of G with mr edges. If $F_i$, $1\;{\leq}\;i\;{\leq}\;m$, has exactly r edges in common with H, we say that F is r-orthogonal to H. If for any partition {$A_1$, $A_2$, ..., $A_m$} of E(H) with $|A_i|=r$ there is a (g, f)-factorization F = {$F_1$, $F_2$, ..., $F_m$} of G such that $A_i\;{\subseteq}E(F_i)$, $1\;{\leq}\;i\;{\leq}\;m$, then we say that G has (g, f)-factorizations randomly r-orthogonal to H. In this paper it is proved that every (0, mf - (m - 1)r)-graph has (0, f)-factorizations randomly r-orthogonal to any given subgraph with mr edges if $f(x)\;{\geq}\;3r\;-\;1$ for any $x\;{\in}\;V(G)$.

Keywords

References

  1. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, American Elsevier Publishing Co., Inc., New York, 1976
  2. H. Feng, On orthogonal (0, f)-factorizations, Acta Math. Sci. (English Ed.) 19 (1999), no. 3, 332-336
  3. M. Kano, [a, b]-factorization of a graph, J. Graph Theory 9 (1985), no. 1, 129-146 https://doi.org/10.1002/jgt.3190090111
  4. G. Li and G. Liu, (g, f)-factorization orthogonal to any subgraph, Sci. China Ser.A 27 (1997), no. 12, 1083-1088
  5. G. Liu, (g, f)-factorizations orthogonal to a star in graphs, Sci. China Ser. A 38 (1995), no. 7, 805-812
  6. G. Liu, Orthogonal (g, f)-factorizations in graphs, Discrete Math. 143 (1995), no. 1-3, 153-158 https://doi.org/10.1016/0012-365X(94)00033-F
  7. G. Liu and B. Zhu, Some problems on factorizations with constraints in bipartite graphs, Discrete Appl. Math. 128 (2003), no. 2-3, 421-434 https://doi.org/10.1016/S0166-218X(02)00503-6
  8. L. Lovasz, Subgraphs with prescribed valencies, J. Combinatorial Theory 8 (1970), 391-416 https://doi.org/10.1016/S0021-9800(70)80033-3
  9. T. Tokuda, Connected [a, b]-factors in $K_{1.n}$-free graphs containing an [a, b]-factor, Discrete Math. 207 (1999), no. 1-3, 293-298 https://doi.org/10.1016/S0012-365X(99)00113-2
  10. J. Yuan and J. Yu, Random (m, $\gamma$)-orthogonal (g, f)-factorizable graphs, Appl. Math. A J. Chinese Univ. (Ser. A) 13 (1998), no. 3, 311-318

Cited by

  1. Randomly orthogonal factorizations in networks vol.93, 2016, https://doi.org/10.1016/j.chaos.2016.10.019