(g, f)-factorizations randomly orthogonal to a subgraph in graphs

Hao Zhao; Gui Zhen Liu; Xiao Xia Yan

doi:10.1007/s10114-004-0482-4

(g, f)-factorizations randomly orthogonal to a subgraph in graphs

Hao Zhao^*, Gui Zhen Liu, Xiao Xia Yan

^*此作品的通讯作者

数学学院

科研成果: 期刊稿件 › 文章 › 同行评审

1 引用（Scopus）

摘要

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.

源语言	英语
页（从-至）	413-422
页数	10
期刊	Acta Mathematica Sinica, English Series
卷	21
期	2
DOI	https://doi.org/10.1007/s10114-004-0482-4
出版状态	已出版 - 4月 2005

访问文件

10.1007/s10114-004-0482-4

其它文件与链接

链接到 Scopus 的出版物

引用此

Zhao, H., Liu, G. Z., & Yan, X. X. (2005). (g, f)-factorizations randomly orthogonal to a subgraph in graphs. Acta Mathematica Sinica, English Series, 21(2), 413-422. https://doi.org/10.1007/s10114-004-0482-4

@article{4aaed97ff9bc49d4a42015fcd623f97b,

title = "(g, f)-factorizations randomly orthogonal to a subgraph in graphs",

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.",

keywords = "(g,f)-factorization, Graph, Randomly k-orthogonal factorization",

author = "Hao Zhao and Liu, {Gui Zhen} and Yan, {Xiao Xia}",

year = "2005",

month = apr,

doi = "10.1007/s10114-004-0482-4",

language = "English",

volume = "21",

pages = "413--422",

journal = "Acta Mathematica Sinica, English Series",

issn = "1439-8516",

publisher = "Springer Verlag",

number = "2",

}

TY - JOUR

T1 - (g, f)-factorizations randomly orthogonal to a subgraph in graphs

AU - Zhao, Hao

AU - Liu, Gui Zhen

AU - Yan, Xiao Xia

PY - 2005/4

Y1 - 2005/4

N2 - 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.

AB - 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.

KW - (g,f)-factorization

KW - Graph

KW - Randomly k-orthogonal factorization

UR - http://www.scopus.com/inward/record.url?scp=17444383496&partnerID=8YFLogxK

U2 - 10.1007/s10114-004-0482-4

DO - 10.1007/s10114-004-0482-4

M3 - Article

AN - SCOPUS:17444383496

SN - 1439-8516

VL - 21

SP - 413

EP - 422

JO - Acta Mathematica Sinica, English Series

JF - Acta Mathematica Sinica, English Series

IS - 2

ER -

(g, f)-factorizations randomly orthogonal to a subgraph in graphs

摘要

访问文件

其它文件与链接

指纹

引用此