On the Number of All Substructures Containing at Most Four Edges

IF 2.9 2区化学 Q2 CHEMISTRY, MULTIDISCIPLINARY

Match-Communications in Mathematical and in Computer Chemistry Pub Date : 2022-08-01 DOI:10.46793/match.89-2.327g

S. Gong, Liping Zhang, Changbao Su

引用次数: 0

Abstract

Let G be a simple graph with order n , n ≥ 5, and adjacency matrix A ( G ). In this paper, we determine the number of all substructures having at most four edges in terms of its adjacency matrix A ( G ) together with some graph invariants determined by A ( G ). Then, as applications, we provide an algebraic expression for the second Zagreb index and || A 4 || of a graph.

查看原文本刊更多论文

关于最多包含四条边的所有子结构的数目

设G为n阶简单图，n≥5，邻接矩阵a (G)。本文利用图的邻接矩阵A (G)和由A (G)决定的图不变量，确定了图中最多有四条边的所有子结构的个数。然后，作为应用，我们给出了图的第二次Zagreb索引和a_4的代数表达式。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Match-Communications in Mathematical and in Computer Chemistry 化学-化学综合

CiteScore

4.40

自引率

26.90%

发文量

审稿时长

2 months

期刊介绍： MATCH Communications in Mathematical and in Computer Chemistry publishes papers of original research as well as reviews on chemically important mathematical results and non-routine applications of mathematical techniques to chemical problems. A paper acceptable for publication must contain non-trivial mathematics or communicate non-routine computer-based procedures AND have a clear connection to chemistry. Papers are published without any processing or publication charge.