| （g, f）-Factorizations Randomly Orthogonal to a Subgraph in Graphs |
| |
| 作者姓名： | HaoZHAO GuiZhenLIU XiaoXiaYAN |
| |
| 作者单位： | [1]DepartmentofComputerScience,CityUniversityofHongKong,Kowloon,HongKong [2]DepartmentofMathematics,ShandongUniversity,Jinan250100,P.R.China [3]DepartmentofAppliedMathematics,BeijingInstituteofTechnology,Beijing100081,P.R.China |
| |
| 摘 要： | Let G be a graph with vertex set V(G) and edge set E(G) and let g and f be two integervalued functions defined on V(G) such that 2k - 2 ≤g(x)≤f(x) for all x∈V(G). Let H be a subgraph of G with mk edges. In this paper, it is proved that every (mg m-1,mf-m 1)-graph G has (g, f)-factorizations randomly k-orthogonal to H under some special conditions.
|
| 关 键 词： | 顶集 边集 积值函数 图论 有限无向图 |
| 收稿时间： | 17 May 2002 |
(g, f)–Factorizations Randomly Orthogonal to a Subgraph in Graphs |
| |
| HaoZHAO GuiZhenLIU XiaoXiaYAN.(g, f)–Factorizations Randomly Orthogonal to a Subgraph in Graphs[J].Acta Mathematica Sinica,2005,21(2):413-422. |
| |
| Authors: | Hao Zhao Gui Zhen Liu Xiao Xia Yan |
| |
| Institution: | (1) Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong;(2) Department of Mathematics, Shandong University, Jinan 250100, P. R. China;(3) Department of Applied Mathematics, Beijing Institute of Technology, Beijing 100081, P. R. China |
| |
| Abstract: | Let G be a graph with vertex set V (G) and edge set E(G) and let g and f be two integervalued
functions defined on V (G) such that 2k – 2 ≤ g(x) ≤ f(x) for all x ∈ V (G). Let H be a
subgraph of G with mk edges. In this paper, it is proved that every (mg +m– 1,mf – m + 1)–graph
G has (g, f)–factorizations randomly k–orthogonal to H under some special conditions.
The work is partially supported by NNSF of China (10471078) and RSDP of China |
| |
| Keywords: | Graph (g f)– factorization Randomly k– orthogonal factorization |
| 本文献已被 维普 SpringerLink 等数据库收录！ |
|
