|
|||||
|
|
| The Linear Arboricity of Graphs | |
| 作者姓名： | 吴建良 苗莲英 |
| 摘 要： | Inthispaper,allgraphsarefinite,simpleandundirected.Forarealnumberx,[x]istheleastintegernotlessthanx.LetG＝(V(G),E(G))beagraph.Weuse△(G)andδ(G)todenotethemaximum(vertex)degreeandtheminimum(vertex)degreeofG.Letw(G)＝min{d(u) d(v):uv∈E(G)}.Thegirthg(G)ofGistheminimumlengthofcycles.Thedensitymad(G)ofagraphGisthemaximumvalueof2|E(H)|/|V(H)|takenoverallsubgraphsHofG.Ifv6V(G),N(v)denotesthesetofvenicesadjacenttov,thedegreedG(v)isING(v)landNc(v)={aluEN(v)andd(u)=k}.Avertexofdegreekisc… |
| 本文献已被 CNKI 等数据库收录！ | |