| 34 | 3 | 17 |
| 下载次数 | 被引频次 | 阅读次数 |
对任一个n阶单图G,用a(G)表示G的代数连通度,GC表示它的补图.针对双圈图,即边数等于顶点数加1的且只含有2个边不交的基本圈的简单连通图,证明了对任一n阶双圈图G,有1≤a(G)+a(GC),当且仅当G≌G1时等式成立.
Abstract：Let G be a simple graph with a(G) and GC,its algebraic connectivity and complement graph.It is proved that it holds for the algebraic connectivity of Nordhaus-Gaddum type for a double-cyclic graph that 1 ≤ a(G) + a(GC).
[1]Fiedler M.Algebraic connectivity of graph[J].Czech Math J,1973,23(2):298-305.
[2]Nordhaus E A,Gaddum J W.On complementary grarphs[J].Amer Math Monthly,1956,63(3):175-177.
[3]Li X L.The relations between the spectral radius of a graphand its complement[J].J North China Technol Inst,1996,17(4):297-299.
[4]Zhou Bo.A note about the relations between the spectral ra-dius of a graph and its complement[J].Pure Appl Math,1997,13(1):15-18.
[5]Hong Yuan,Shu Jinhong.A sharp upper bound for thespectral radius of the Nordhaus-Gaddum type[J].DiscreteMathematics.2000,211(1/2/3):229-232.
[6]吕大梅,冯瑞华.N-G型的代数连通度的界[J].浙江大学学报:理学版,2012,39(2):130-134.
[7]Nosal E.Eigenvalues of graphs[D].Calgary:Mathematics,University of Calgary,1970.
[8]吕大梅,杜娟,吕嘉钧.图的Nordhaus-Gaddumm型的代数连通度的界[J].浙江大学学报:理学版,2009,36(6):616-619.
[9]吕大梅,吕嘉钧,杜娟.拟双星图的N-G型的代数连通度的界[J].南通大学学报:自然科学版,2005,4(1):22-23.
[10]吕大梅,吕嘉钧.单圈图的N-G型的代数连通度的界[J].浙江大学学报:理学版,2006,33(4):368-371.
[11]Merris R.Laplacian matrics of graphs:a survey[J].Lin-ear Algebra and its Applications,1994,197/198:143-176.
[12]邓汉元,徐立新.双圈图的Laplace谱半径[J].湖南师范大学自然科学学报,2002,25(1):1-3.
[13]Kirkland S.A bound on the algebraic connectivity of agraph in terms of the number of cutpoints[J].Linear&Mul-tilinear Algebra,2000,47(1):93-103.
[14]Rojo O,Soto R,Rojo H.An always nontrivial upper boundfor Laplacian graph eigenvalues[J].Linear Algebra andits Applications,2000,312(1/2/3):155-159.
基本信息:
DOI：
中图分类号:O157.5
引用信息:
[1]徐莉,李海萍,吕大梅等.双圈图的N-G型的代数连通度的界[J],2012,11(04):82-85.
基金信息:
国家自然科学基金项目(10671033);; 南通大学自然科学基金项目(11Z055,11Z056,11Z059);; 江苏省教育科学“十一五”规划青年专项课题(C-b200901039)