Complexity of subdivision-vertex and subdivision-edge join graphs

DOI10.1080/09720529.2020.1826166MaRDI QIDQ5043938zbMATH OpenOpenAlexFDO

Authors 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

generalized graph entropysignless Laplacian matrixsubdivision-edge joinsubdivision-vertex joinZagreb index

Mathematics Subject Classification ID

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

Cites work

• An introduction to the theory of graph spectra
• Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
• Information processing in complex networks: Graph entropy and information functionals
• Novel inequalities for generalized graph entropies -- graph energies and topological indices
• Spectrum of two new joins of graphs and infinite families of integral graphs
• Studying thermodynamic properties of linear acenes molecules \((C_{4n+2}H_{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

Cited in

(2)

• On the complexity of finite subgraphs of the curve graph
• On the facets of the lift-and-project relaxations of graph subdivisions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5043938)