154
Views
17
CrossRef citations to date
0
Altmetric
Research Articles

Computing the Laplacian Spectrum of Linear Octagonal-Quadrilateral Networks and Its Applications

, , , , &
Pages 659-670 | Received 17 Dec 2019, Accepted 25 Mar 2020, Published online: 11 Apr 2020

References

  • F. R. K. Chung, Spectral Graph Theory (Providence, RI: American Mathematical Society, 1997).
  • H. Wiener, “Structural Determination of Paraffin Boiling Points,” Journal of the American Chemical Society 69, no. 1 (1947): 17–20.
  • A. Dobrynin, “Branchings in Trees and the Calculation of the Wiener Index of a Tree,” Match Communications in Mathematical and in Computer Chemistry 41, (2000): 119–34.
  • D. J. Klein, and M. Randić, “Resistance Distances,”Journal of Mathematical Chemistry 12, no. 1 (1993): 81–95.
  • D. J. Klein, “Resistance-Distance Sum Rules,” Croatica Chemica Acta 75, (2002): 633–49.
  • D. J. Klein, and O. Ivanciuc, “Graph Cyclicity, Excess Conductance, and Resistance Deficit,”Journal of Mathematical Chemistry 30, no. 3 (2001): 271–87.
  • I. Gutman, and B. Mohar, “The quasi-Wiener and the Kirchhoff Indices Coincide,” Journal of Chemical Information and Computer Sciences 36, no. 5 (1996): 982–5.
  • H. Y. Zhu, D. J. Klein, and I. Lukovits, “Extensions of the Wiener Number,” Journal of Chemical Information and Computer Sciences 36, no. 3 (1996) : 420–8.
  • Y. J. Yang, and H. P. Zhang, “Kirchhoff Index of Linear Hexagonal Chains,” International Journal of Quantum Chemistry 108, no. 3 (2008): 503–12.
  • J. Huang, S. C. Li, and L. Sun, “The Normalized Laplacians degree-Kirchhoff Index and the Spanning Trees of Linear Hexagonal Chains,” Discrete Applied Mathematics 207, (2016) : 67–79.
  • Y. J. Peng, and S. C. Li, “On the Kirchhoff Index and the Number of Spanning Trees of Linear Phenylenes,” Match Communications in Mathematical and in Computer Chemistry 77, (2017): 765–80.
  • Z. X. Zhu, and J. B. Liu, “The Normalized Laplacian, degree-Kirchhoff Index and the Spanning Tree Numbers of Generalized Phenylenes,” Discrete Applied Mathematics 254, (2019): 256–67.
  • Y. Pan, and J. Li, “Kirchhoff Index, Multiplicative degree-Kirchhoff Index and Spanning Trees of the Linear Crossed Hexagonal Chains,” International Journal of Quantum Chemistry 118 , no. 24 (2018) : e25787.
  • Y. Pan, C. Liu, and J. Li, “Kirchhoff Indices and Numbers of Spanning Trees of Molecular Graphs Derived from Linear Crossed Polyomino Chain,” Polycyclic Aromatic Compounds (2020). doi: https://doi.org/10.1080/10406638.2020.1725898
  • C. Liu, Y. Pan, and J. Li, “On the Laplacian Spectrum and Kirchhoff Index of Generalized Phenylenes,” Polycylic Aromatic Compounds (2019) doi: https://doi.org/10.1080/10406638.2019.1703765
  • X. Geng, P. Wang, L. Lei, and S. Wang, “On the Kirchhoff Indices and the Number of Spanning Trees of Mo¨ Bius Phenylenes Chain and Cylinder Phenylenes Chain,” Polycyclic Aromatic Compounds (2019). doi: https://doi.org/10.1080/10406638.2019.1693405
  • L. Lei, X. Geng, S. C. Li, Y. J. Peng, and Y. Yu, “On the Normalized Laplacian of Mo¨ Bius Phenylene Chain and Its Applications,” International Journal of Quantum Chemistry 119 , no. 24 (2019): e26044.
  • X. Ma, and H. Bian, “The Normalized Laplacians, degree-Kirchhoff Index and the Spanning Trees of Cylinder Phenylene Chain,” Polycyclic Aromatic Compounds (2019): 1–21. doi: https://doi.org/10.1080/10406638.2019.1665553
  • X. Ma, and H. Bian, “The Normalized Laplacians, degree-Kirchhoff Index and the Spanning Trees of Hexagonal Mo¨ Bius Graphs,” Applied Mathematics and Computation 355, (2019) : 33–46.
  • J. B. Liu, J. Zhao, and Z. Zhu, “On the Number of Spanning Trees and Normalized Laplacian of Linear Octagonal-Quadrilateral Networks,” International Journal of Quantum Chemistry 119, no. 17 (2019) : e25971.
  • J. B. Liu, J. Zhao, and Z. Cai, “On the Generalized Adjacency, Laplacian and Signless Laplacian Spectra of the Weighted Edge Corona Networks,” Physica A: Statistical Mechanics and Its Applications 540, (2020) : 123073.
  • J. Zhao, J. B. Liu, and S. Hayat, “Resistance Distance-Based Invariants and the Number of Spanning Trees of Linear Crossed Octagonal Graphs,” Journal of Applied Mathematics and Computing (2019). doi:https://doi.org/10.1007/s12190-019-01306-6
  • S. C. Li, W. Wei, and S. Yu, “On Normalized Laplacians, Multiplicative degree-Kirchhoff Indices, and Spanning Trees of the Linear [n] Phenylenes and Their Dicyclobutadieno Derivatives,” International Journal of Quantum Chemistry 119, no. 8 (2019): e25863.
  • S. C. Li, W. Sun, and S. Wang, “Multiplicative degree-Kirchhoff Index and Number of Spanning Trees of a Zigzag Polyhex Nanotube TUHC [2n,2],” International Journal of Quantum Chemistry 119, no. 17 (2019): e25969.
  • J. Huang, S. C. Li, and X. Li, “The Normalized Laplacian, degree-Kirchhoff Index and Spanning Trees of the Linear Polyomino Chains,” Applied Mathematics and Computation 289, (2016) : 324–34.
  • Y. L. Yang, and T. Y. Yu, “Graph Theory of Viscoelasticities for Polymers with Starshaped, Multiple-Ring and Cyclic Multiple-Ring Molecules,” Die Makromolekulare Chemie 186, no. 3 (1985): 609–31.
  • R. C. Entringer, D. E. Jackson, and D. A. Snyder, “Distance in Graphs,” Czechoslovak Mathematical Journal 26, (1976) : 283–96.
  • W. N. Anderson, and T. D. Morley, “Eigenvalues of the Laplacian of a Graph,” Linear and Multilinear Algebra 18, no. 2 (1985): 141–5.
  • J. B. Liu, and S. N. Daoud, “The Complexity of Some Classes of Pyramid Graphs Created from a Gear Graph,”Symmetry 10, no. 12 (2018): 689.
  • J. B. Liu, and S. N. Daoud, “Number of Spanning Trees in the Sequence of Some Graphs,” Complexity 2019, (2019) : 1–22.
  • K. H. Monfared, and S. Mallik, “An Analog of Matrix Tree Theorem for Signless Laplacians,” Linear Algebra and Its Applications 560, (2019) : 43–55.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.