职称 | 教授 |
---|---|
职务 | 博士生导师 |
主讲课程 | 组合数学、图论 |
研究方向 | 图论及其应用 |
办公室 | 数计学院2号楼306 |
电子邮件 | |
办公电话 | 0591-22865158 |
常安,男,1962年生,博士研究生毕业,教授,博士生导师。1983年6月毕业于青海师范大学,获学士学位学位;1990年获新疆大学硕士学位;1998年6月毕业于四川大学,获博士学位。主要从事图论领域中的代数图论,化学图论等方向的基础理论研究。曾经参加过多项国家基金项目的研究工作,目前是国家基金委重点项目和国家重点研究计划973项目课题组的主要研究成员,并主持一项国家自然课基金项目的研究工作。1995年获青海省科技进步三等奖,2004年获福建省科学技术二等奖。
承担或参加的科研项目
- 2006.9-2011.8 大规模集成电路设计中的图论与代数方法 国家科技部“973”课题(研究成员)
- 2010.1-2013.12 极值图论 国家自然科学基金重点项目(研究成员)
- 2005.1-2008.12 子图覆盖与子图存在性的若干问题 国家自然科学基金重点项目(研究成员)
- 2009.1-2011.12 图与超图谱理论的若干应用问题研究 国家自然科学基金面上项目(主持)
- 2004.1-2006.12 整数流、子图覆盖与代数图论 国家自然科学基金面上项目(研究成员)
- 2003.1-2004.12 图论在数学化学中的应用 国家自然科学基金面上项目(研究成员)
- 2000.1-2002.12 图、多面体与数学化学 国家自然科学基金面上项目(研究成员)
- 2005.9-2007.8 图的若干拓扑指标及相关问题的研究 福建省自然科学基金(主持)
- 2002.1-2004.12 某些分子图类能量及度距离问题的研究 福建省教育厅科技项目(主持)
- 1999-2001 特殊分子图类的拓扑性质研究 福建省教育厅科技项目(主持)
获奖成果
- 图论研究中的若干问题,2004年福建省科学技术奖二等奖(1)
- 图的色等价与色唯一性,1995年青海省科技进步三等奖(2)
- Bounds on the second largest eigenvalue of a tree with perfect matchings,福建省第五届自然科学优秀论文二等奖
已发表的主要研究论文
[1] J. Li, W. C. Shiu, A. Chang,On the kth Laplacian eigenvalues of trees with perfect matchings,Linear Algebra and its Applications,432(2010)4,1036-1041.
[2] J. Li, W. C. Shiu, A. Chang,The number of spanning trees of a graph,APPLIED MATHEMATICS LETTERS,23(3)(2010),286-290.
[3] J. Li,W. C. Shiu,W. H. Chan,A. Chang,On the spectral radius of graphs with connectivity at most k,J. of Mathematical Chemistry,(2009) 46:340–346,DOI 10.1007/s10910-008-9465-5
[4] J. Li, W. C. Shiu, A. Chang: On the Laplacian Estrada index of a graph, Appl.Anal. Discr. Math. 3 (2009), 147-156.
[5] Yuan Hou, An Chang, Minimum degree distance of unicyclic graphs with perfect matching,J. Fuzhou Univ. Nat. Sci. Ed.36 (2008), No.3,323-326.
[6] Li, Jian Xi; An Chang,Some applications on the method of eigenvalue interlacing for graphs.J. Math. Res. Exposition28 (2008), no. 2,251–256.
[7] J. Li, An Chang, W. C. Shiu,On the Nullity of Bicyclic Graphs, MATCH Commun. Math. Comput. Chem.Vol. 60 (2008) No.1, 21-36.
[8] Wei Li, An Chang, Characterization of nonsingular unicyclic graphs.J. Math. Study40 (2007), no. 4,442—445.
[9] An Chang, Wai Chee Shiu, On the kth Eigenvalues of Trees with Perfect Matchings,Discrete Mathematics and Theoretical Computer Science, Vol.9(1) (2007), 321-332.
[10] Wenhuan Wang, An Chang, Dongqiang Lu,Unicyclic graphs possessing Kekule structures with minimal energy, J. of Mathematical Chemistry,Vol.42(2007), No.3, 311-320.
[11] Zhang Jun, An Chang, A note on the sufficient condition for Hamilton graphs, J. Fuzhou Univ. Nat. Sci. Ed.35 (2007), No.1,9-10.
[12] Wenhuan Wang, An Chang, Lianzhu Zhang, Dongqiang Lu, Unicyclic Hückel molecular graphs with minimal energy, J. of Mathematical Chemistry,39(2006),No.1, 231-241.
[13] Wei Li, An Chang, On the trees with maximum nullity, MATCH Commun. Math. Comput. Chem.56(2006), 501-508.
[14] Wei Li, An Chang, On the tricyclic graphs whose second largest eigenvalue does not exceed 1, J. of Xinjiang University (Nat. Sci. Ed.) 23 (2006), Supp., 36-43.
[15] Yuan Hou, An Chang, The unicyclic graph with maximum degree distance, J. Math. Study, 39(2006). No.1, 18-24.
[16] Ailian Cnen, An Chang, Wai Chee Shiu, Energy ordering of unicyclic graphs, MATCH Commun. Math. Comput. Chem. 55(2006), 95-102.
[17] Pin Long You, Yi Rong Zhen, An Chang, Characterizing eccentric graphs of some graphs, J. Fuzhou Univ. Nat. Sci. Ed.34 (2006), No.1,5-9.
[18] Yi Rong Zhen, An Chang, An upper bound on the second largest eigenvalue of unicyclic graphs with perfect matchaings, J. of Xinjiang University (Nat. Sci. Ed.) 22 (2005), No.4, 393-399.
[19] An Chang, Feng Tian, Aimei Yu, On the index of bicyclic graphs with perfect matchings, Discrete Mathematics,283(2004),51-59.
[20] An Chang, On the largest eigenvalue of a tree with perfect matchings, Discrete Mathematics,269(2003),45-63.
[21] An Chang, Qunxiang Huang, Ordering trees by their largest eigenvalues, Linear Algebra and its Applications,370(2003),175-184.
[22] An Chang, Feng Tian, On the spectral radius of uncyclic graphs with perfect matchings, Linear Algebra and its Applications,370(2003),237-250.
[23] An Chang, Miao Shengjun, A note on the spectrum and the edge independence number of a graph. (Chinese) J. Fuzhou Univ. Nat. Sci. Ed.30 (2002), No. 4,468-471.
[24] Miao Shengjun, An Chang, Bounds of the Laplacian spectrum of a k-uniform hypergraph. (Chinese) Qufu Shifan Daxue Xuebao Ziran Kexue Ban28 (2002), No.1, 41-44.
[25] Qunxiang Huang, An Chang, Circulant digraphs determined by their spectra, Discrete Mathematics, 240(1-3), (2001), 261-270.
[26] An Chang,The Laplacian of the complement of a k-uniform hypergraph. J. Math. Study33 (2000), No. 3,251-260.
[27] Fuji Zhang, An Chang, Acyclic molecules with greatest HOMO-LUMO separation, Discrete Applied Mathematics,98 (1999), 165-171.
[28] An Chang, Sub-large value and quasi-small value of the largest eigenvalue of the trees with perfect matchings. (Chinese) Appl. Math. J. Chinese Univ. Ser. A14 (1999), No.4, 397-403.
[29] An Chang, Some properties of the spectrum of graphs. Appl. Math. J. Chinese Univ. Ser. B14 (1999), No.1, 103-107.
[30] An Chang, On the Laplacian of a hypergraph,Math. Appl. (Wuhan) 12 (1999), No.4, 93-97.
[31] An Chang, Bounds on the second largest eigenvalue of a tree with perfect matchings,Linear Algebra and its Applications,283(1-3 ), (1998), 247-255.
[32] An Chang, An extension of a majorization theorem on graph spectrum. J. Math. Study, 31 (1998), No.4, 370-375.