ON THE VERTEX DEGREE POLYNOMIAL OF GRAPHS

被引:0
|
作者
Ahmed, H. [1 ]
Alwardi, A. [2 ]
Salestina M, R. [1 ]
机构
[1] Univ Mysore, Dept Math, Yuvarajas Coll, Mysuru, India
[2] Univ Jeddah, Dept Math, Fac Sci, Jeddah, Saudi Arabia
关键词
Vertex degree polynomial; Vertex degree roots; First Zagreb index; Second Zagreb index; Kragujevac tree; MOLECULAR-ORBITALS;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
A novel graph polynomial, termed as vertex degree polynomial, has been conceptualized, and its discriminating power has been investigated regarding its coefficients and the coefficients of its derivatives and their relations with the physical and chemical properties of molecules. Correlation coefficients ranging from 95% to 98% were obtained using the coefficients of the first and second derivatives of this new polynomial. We also show the relations between this new graph polynomial, and two oldest Zagreb indices, namely the first and second Zagreb indices. We calculate the vertex degree polynomial along with its roots for some important families of graphs like tadpole graph, windmill graph, firefly graph, Sierpinski sieve graph and Kragujevac trees. Finally, we use the vertex degree polynomial to calculate the first and second Zagreb indices for the Dyck-56 network and also for the chemical compound triangular benzenoid G[r].
引用
收藏
页码:232 / 245
页数:14
相关论文
共 50 条
  • [31] Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
    Blaesius, Thomas
    Fischbeck, Philipp
    Friedrich, Tobias
    Katzmann, Maximilian
    THEORY OF COMPUTING SYSTEMS, 2023, 67 (01) : 28 - 51
  • [32] Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
    Blaesius, Thomas
    Fischbeck, Philipp
    Friedrich, Tobias
    Katzmann, Maximilian
    37TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2020), 2020, 154
  • [33] A polynomial time algorithm for cyclic vertex connectivity of cubic graphs
    Liang, Jun
    Lou, Dingjun
    Zhang, Zanbo
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2017, 94 (07) : 1501 - 1514
  • [34] Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators
    Diptapriyo Majumdar
    Venkatesh Raman
    Saket Saurabh
    Theory of Computing Systems, 2018, 62 : 1910 - 1951
  • [35] Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators
    Majumdar, Diptapriyo
    Raman, Venkatesh
    Saurabh, Saket
    THEORY OF COMPUTING SYSTEMS, 2018, 62 (08) : 1910 - 1951
  • [36] The polyomino graphs whose resonance graphs have a 1-degree vertex
    Sun, Chunhu
    Zhang, Yaxian
    Zhang, Heping
    APPLIED MATHEMATICS AND COMPUTATION, 2024, 474
  • [37] On Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs
    Takaoka, Asahi
    Tayu, Satoshi
    Ueno, Shuichi
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2013, E96D (11): : 2327 - 2332
  • [38] Extremal graphs for vertex-degree-based invariants with given degree sequences
    Liu, Muhuo
    Xu, Kexiang
    Zhang, Xiao-Dong
    DISCRETE APPLIED MATHEMATICS, 2019, 255 : 267 - 277
  • [39] On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree
    Chen, Min
    Yu, Weiqiang
    Wang, Weifan
    APPLIED MATHEMATICS AND COMPUTATION, 2018, 326 : 117 - 123
  • [40] Degree associated reconstruction number of certain connected graphs with unique end vertex and a vertex of degree n-2
    Anu, A.
    Monikandan, S.
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2016, 8 (04)