On Acyclic Molecular Graphs with Prescribed Numbers of Edges that Connect Vertices with given Degrees期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

按检索

On Acyclic Molecular Graphs with Prescribed Numbers of Edges that Connect Vertices with given Degrees

Authors:

Institution:

(1) Department of Mathematics, University of Zagreb, Bijenička 10, HR-10000 Zagreb, Croatia;(2) Department of Mathematics, University of Split, Nikole Tesle 12, HR-21000 Split, Croatia

Abstract:

We find a necessary and sufficient conditions on a sequence

$\left(m_{11},m_{12},m_{13},m_{14},m_{22},m_{23},m_{24},m_{33},m_{34},m_{44}\right)$

for the existence of an acyclic molecular graph G such that exactly m _ij edges connect vertices of degree i and j. We use this result together with two additional results to make an algorithm that generates all the sequences

$\left( m_{11},m_{12},m_{13},m_{14},m_{22},m_{23},m_{24},m_{33},m_{34}, m_{44}\right)$

such that a molecular acyclic graph exists with exactly m _ij edges connecting vertices of degree i and j. This algorithm is utilized to compare discriminative properties of the Zagreb index and the modified Zagreb index, and it is found that the modified Zagreb index is more discriminative then the Zagreb index.

Keywords:

本文献已被 SpringerLink 等数据库收录！

设为首页 | 免责声明 | 关于勤云 | 加入收藏