
doi: 10.3934/math.2024347
<abstract><p>In this paper, we focus on the strong product of the pentagonal networks. Let $ R_{n} $ be a pentagonal network composed of $ 2n $ pentagons and $ n $ quadrilaterals. Let $ P_{n}^{2} $ denote the graph formed by the strong product of $ R_{n} $ and its copy $ R_{n}^{\prime} $. By utilizing the decomposition theorem of the normalized Laplacian characteristics polynomial, we characterize the explicit formula of the multiplicative degree-Kirchhoff index completely. Moreover, the complexity of $ P_{n}^{2} $ is determined.</p></abstract>
pentagonal network, QA1-939, multiplicative degree-kirchhoff index, the normalized laplacian, complexity, strong product, Mathematics
pentagonal network, QA1-939, multiplicative degree-kirchhoff index, the normalized laplacian, complexity, strong product, Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
