期刊文献+

秩为6的化学图

Chemical graph with rank 6
下载PDF
导出
摘要 图谱理论是代数图论中的重要内容,图谱理论最开始是化学家与物理学家在解决一类偏微分方程解时建立的离散的图模型.图谱理论主要就是利用矩阵理论的方法和技巧来解决图矩阵的性质,从而用这些矩阵性质来反映图的一些结构和拓扑性质,其中最普遍就是通过图的特征值来反映图的结构性质.设图G是一个n阶图,图G的秩r(G)定义为图G邻接矩阵的秩,图G的顶点集为V(G),顶点v的度d(v)定义为与顶点v关联边的数量,如果对于任意v∈V(G),都有d(v)≤3,则称图G为化学图,这里刻画了秩为6的化学图. Graph theory is an important part of algebraic graph theory,which was originally a discrete graph model established by chemists and physicists when solving a class of partial differential equations.Graph theory is mainly to use the methods and skills of matrix theory to solve the properties of graph matrices,so as to use these matrix properties to reflect some structural properties and topological properties of graphs.Graph G is an n-order diagram.The rank r(G)of graph G is defined as the rank of the adjacency matrix of graph G,and the vertex set of graphs G is V(G).The degree d(v)of vertex v is defined as the number of edges associated with vertex v,for any v∈V(G),have d(v)≤3,then the graph G is called a chemical graph.This paper had described the chemical graph of rank 6.
作者 张玉杰 王龙 ZHANG Yujie;WANG Long(School of Mathematics and Big Data,Anhui University of Science and Technology,Huainan 232001,China)
出处 《哈尔滨商业大学学报(自然科学版)》 CAS 2024年第4期465-468,512,共5页 Journal of Harbin University of Commerce:Natural Sciences Edition
基金 安徽省自然科学基金项目(2308085MA02)。
关键词 邻接矩阵 化学图 奇异图 非奇异图 rank adjacency matrix chemical graph degree singular diagrams non-singular diagrams
  • 相关文献

参考文献4

二级参考文献20

  • 1Wang Yi,Fan Yizheng,Tan Yingying.ON GRAPHS WITH THREE DISTINCT LAPLACIAN EIGENVALUES[J].Applied Mathematics(A Journal of Chinese Universities),2007,22(4):478-484. 被引量:1
  • 2D. CVETKOVIC, M. DOOB, H. SACHS. Spectra of Graphs. Academic Press, New York, 1980.
  • 3H. C. LONGUET-HIGGINS. Resonance structures and MO in unsaturated hydrocarbons. J. Chem. Phys., 1950, 18: 265-274.
  • 4L. COLLATZ, U. SINOGOWITZ. Spektren endlicher Grafen. Abh. Math. Sem. Univ. Hamburg, 1957,21: 63-77. (in German).
  • 5Bo CHENG, Bolian LIU. On the nullity of tricyclic graphs. Linear Algebra Appl., 2011, 434(8): 1799-1810.
  • 6Jiming GUO, Weigen YAN, Yeongnan YEH. On the nullity and the matching number of unicyclic graphs. Linear Algebra Appl., 2009, 431(8): 1293-1301.
  • 7Shengbiao HU, Xuezhong TAN, Bolian LIU. On the nullity of bicyclic graphs. Linear Algebra Appl., 2008, 429(7): 1387-1391.
  • 8Xuezhong TAN, Bolian LIU. On the nullity of unicyclic graphs. Linear Algebra Appl., 2005, 408: 212-220.
  • 9S. FIORINI, I. GUTMAN,I. SCIRIHA. Trees with maximum nullity. Linear Algebra Appl., 2005, 397 :245-25l.
  • 10Wei LI, An CHANG. On the trees with maximum nullity. MATCH Commun. Math. Cornput. Chem., 2006, 56(3): 501-508.

共引文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部