Linear Arboricity of Regular Digraphs-中国Betway体育网页登陆

摘要 Alineardirectedforestisadirectedgraphinwhicheverycomponentisadirectedpath.Thelineararboricityla（D）ofadigraphDistheminimumnumberoflineardirectedforestsinDwhoseunioncoversallarcsofD.Foreveryd-regulardigraphD,NakayamaandPerocheconjecturethatla（D）=d＋1.Inthispaper,weconsiderthelineararboricityforcompletesymmetricdigraphs,regulardigraphswithhighdirectedgirthandrandomregulardigraphsandweimprovesomewell-knownresults.

1ZHU XUSHENG;WANG WEIKE.THE REGULAR SOLUTIONS OF THE ISENTROPIC EULER EQUATIONS WITH DEGENERATE LINEAR DAMPING.基础数学,2005-04.
2徐振远.ON LINEAR AND NONLINEAR RIEMANN-HILBERT PROBLEMS FOR REGULAR FUNCTION WITH VALUES IN A CLIFFORD ALGEBRA.基础数学,1990-03.
3.Infinite Circulant Digraphs and Random Infinite Circulant Digraphs.基础数学,2002-04.
4蔡茂诚.COVERING TWO DIGRAPHS WITH ARBORESCENCES.系统科学,1990-03.
5Jirimutu;Jun Wang;Xu Xirong.On the Gracefulness of the Digraphs n·Cm＊.系统科学,2009-03.
6ZHANG Xin-hong;LI Rui-juan;AN Xiao-ting.The hamiltonicity on the competition graphs of round digraphs.基础数学,2018-04.
7ZHANGKEMIN;BuYUEHUA.ON THE EXPONENT SET OF PRIMITIVELOCALLY SEMICOMPLETE DIGRAPHS.基础数学,1997-03.
8Huang Qiongxiang.ON ARC-TRANSITIVE CIRCULANT DIGRAPHS.基础数学,1997-04.
9HUANGQIONGXIANG DUZHIHUA.ISOMORPHISMS OF CIRCULANT DIGRAPHS OF DEGREE 3.基础数学,1996-01.
10YongHuaLI;HalBinKAN;BingJunYU.On Weak Regular ^＊-semigroups.基础数学,2004-03.

Linear Arboricity of Regular Digraphs

来源期刊

相关推荐

同分类资源更多

相关关键词