Complexity of subdivision-vertex and subdivision-edge join graphs

DOI10.1080/09720529.2020.1826166zbMath1498.94038OpenAlexW3137751888MaRDI QIDQ5043938

Zeynep Nihan Odabaş Berberler

Publication date: 6 October 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2020.1826166

zbMATH Keywords

signless Laplacian matrixZagreb indexsubdivision-edge joinsubdivision-vertex joingeneralized graph entropy

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Measures of information, entropy (94A17) Vertex degrees (05C07) Graph operations (line graphs, products, etc.) (05C76) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

Cites Work

• Unnamed Item
• Unnamed Item
• Information processing in complex networks: Graph entropy and information functionals
• Novel inequalities for generalized graph entropies -- graph energies and topological indices
• Studying thermodynamic properties of linear acenes molecules (C_4n+2H_2n+4) using hyper-Zagreb index
• The first zagreb index and some hamiltonian properties of the line graph of a graph
• The hyper-zagreb index for an infinite family of nanostar dendrimer
• Entropy and the complexity of graphs: I. An index of the relative complexity of a graph

This page was built for publication: Complexity of subdivision-vertex and subdivision-edge join graphs