Some computational aspects of carbon nanocone using Q(G) operator, hexagonal network and probabilistic neural network
From MaRDI portal
Publication:5116096
zbMATH Open1463.05525MaRDI QIDQ5116096FDOQ5116096
Authors: V. Lokesha, K. Zeba Yasmeen, T. Deepika
Publication date: 21 August 2020
Recommendations
- Study of carbon nanocones \(\mathrm{CNC}_k(n)\) via connection Zagreb indices
- On M-polynomial of the two-dimensional silicon-carbons
- M-polynomials and topological indices for line graphs of chain silicate network and H-naphtalenic nanotubes
- Analyzing the boron triangular nanotube through topological indices via \(M\)-polynomial
- Some computational aspects of boron triangular nanotubes
topological indicesprobabilistic neural networkcarbon nanoconeshexagonal networks\(m\)-polynomials\(Q(G)\) operator
Structural characterization of families of graphs (05C75) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
Cited In (4)
This page was built for publication: Some computational aspects of carbon nanocone using \(Q(G)\) operator, hexagonal network and probabilistic neural network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116096)