ON LINEAR VERTEX-ARBORICITY OF COMPLEMENTARY GRAPHS
ALAVI, Y; LIU, JQ; WANG, JF
刊名JOURNAL OF GRAPH THEORY
1994-05-01
卷号18期号:3页码:315-322
ISSN号0364-9024
英文摘要The linear vertex-arboricity rho'(G) of a graph G is defined to be the minimum number of subsets into which the vertex set of G can be partitioned such that each subset induces a linear forest. In this paper, we give the sharp upper and lower bounds for the sum and product of linear vertex-arboricities of a graph and its complement. Specifically, we prove that for any graph G of order p, rho'(G) + rho'(GBAR) less-than-or-equal-to 1 + [(p + 1)/2], rho'(G) . rho'(GBAR) less-than-or-equal-to [([(p + 3)/2]/2)2], and for any graph G of order p = (2n + 1)2, where n is-an-element-of Z+, 2n + 2 less-than-or-equal-to rho'(G) + rho'(GBAR). (C) 1994 John Wiley & Sons, Inc.
WOS研究方向Mathematics
语种英语
出版者JOHN WILEY & SONS INC
WOS记录号WOS:A1994NF54200008
内容类型期刊论文
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/28223]  
专题中国科学院数学与系统科学研究院
通讯作者ALAVI, Y
作者单位CHINESE ACAD SCI,INST APPL MATH,BEIJING,PEOPLES R CHINA
推荐引用方式
GB/T 7714
ALAVI, Y,LIU, JQ,WANG, JF. ON LINEAR VERTEX-ARBORICITY OF COMPLEMENTARY GRAPHS[J]. JOURNAL OF GRAPH THEORY,1994,18(3):315-322.
APA ALAVI, Y,LIU, JQ,&WANG, JF.(1994).ON LINEAR VERTEX-ARBORICITY OF COMPLEMENTARY GRAPHS.JOURNAL OF GRAPH THEORY,18(3),315-322.
MLA ALAVI, Y,et al."ON LINEAR VERTEX-ARBORICITY OF COMPLEMENTARY GRAPHS".JOURNAL OF GRAPH THEORY 18.3(1994):315-322.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace