Topological indices and graph entropies for carbon nanotube Y-junctions
DOI10.1007/s10910-023-01520-5OpenAlexW4387304779MaRDI QIDQ6144520
Vijay Kumar Bhat, Unnamed Author, Sahil Sharma
Publication date: 29 January 2024
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-023-01520-5
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)
Cites Work
- Unnamed Item
- Extremality of degree-based graph entropies
- Information processing in complex networks: Graph entropy and information functionals
- On some counting polynomials in chemistry
- The Clar covering polynomial of hexagonal systems. I
- Graph entropies, enumeration of circuits, walks and topological properties of three classes of isoreticular metal organic frameworks
- Computational analysis of topological index-based entropies of carbon nanotube \(Y\)-junctions
- Planar polycyclic graphs and their Tutte polynomials
- A note on distance-based graph entropies
- THE THIRD VERSION OF ZAGREB INDEX
- M-Polynomial and Degree-Based Topological Indices
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
- Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs
- Entropy and the complexity of graphs: III. Graphs with prescribed information content
- Entropy and the complexity of graphs: IV. Entropy measures and graphical structure
This page was built for publication: Topological indices and graph entropies for carbon nanotube Y-junctions
