Results 1 to 10 of about 120 (110)
Enumeration of the Multiplicative Degree-Kirchhoff Index in the Random Polygonal Chains [PDF]
Molecules, 2022 Multiplicative degree-Kirchhoff index is a very interesting topological index. In this article, we compute analytical expression for the expected value of the Multiplicative degree-Kirchhoff index in a random polygonal. Based on the result above, we also
Wanlin Zhu, Xianya Geng
doaj +4 more sources
The Extremal Cacti on Multiplicative Degree-Kirchhoff Index
Mathematics, 2019 For a graph G, the resistance distance r G ( x , y ) is defined to be the effective resistance between vertices x and y, the multiplicative degree-Kirchhoff index R ∗ ( G ) = ∑ { x , y } ⊂ V ( G ) d G ( x ) d G
Fangguo He, Zhongxun Zhu
doaj +3 more sources
Journal of Mathematics, 2022 It is well known that many topological indices have widespread use in lots of fields about scientific research, and the Kirchhoff index plays a major role in many different sectors over the years. Recently, Li et al. (Appl. Math. Comput.
Jia-Bao Liu +3 more
doaj +1 more source
Journal of Function Spaces, 2023 There has been an upsurge of research on complex networks in recent years. The purpose of this paper is to study the mathematical properties of the random pentagonal chain networks PECn with the help of graph theory.
Jia-Bao Liu, Qing Xie, Jiao-Jiao Gu
doaj +1 more source
Resistance Distances and Kirchhoff Indices Under Graph Operations
IEEE Access, 2020 The resistance distance between any two vertices of a connected graph $G$ is defined as the net effective resistance between them in the electrical network constructed from $G$ by replacing each edge with a unit resistor. The Kirchhoff index of $G$
Yujun Yang, Yue Yu
doaj +1 more source
The normalized Laplacian spectrum and complexity of the chained interconnection-networks [PDF]
AIP AdvancesIn this paper, we present a spectral analysis of the strong prism of the chained polyomino network based on its normalized Laplacian matrix. First, by the decomposition theorem for normalized Laplacian characteristic polynomials in product graphs, we ...
Jia-Bao Liu, Xiao-Juan Tang
doaj +1 more source
Nordhaus-Gaddum-Type Results for Resistance Distance-Based Graph Invariants
Discussiones Mathematicae Graph Theory, 2016 Two decades ago, resistance distance was introduced to characterize “chemical distance” in (molecular) graphs. In this paper, we consider three resistance distance-based graph invariants, namely, the Kirchhoff index, the additive degree-Kirchhoff index ...
Das Kinkar Ch., Yang Yujun, Xu Kexiang
doaj +1 more source
Memristive‐Gated RC‐Delay Synaptic Transistors for Time‐Encoded Analog in‐Memory Computing
Advanced Functional Materials, EarlyView.A Memristive‐Gated Transistor for Time‐Encoded Analog In‐Memory Computing — By exploiting the RC delay of a self‐rectifying interface‐type memristor, nonlinear I–V distortion is structurally bypassed, enabling 3‐bit nonvolatile memory, spike‐timing‐based analog encoding, and hardware‐calibrated reservoir‐computing validation within a unified device ...
Yun‐Seo Shin +7 more
wiley +1 more source
Advanced Functional Materials, EarlyView.The physical realization of artificial neurons is a critical challenge for energy‐efficient neuromorphic computing. This review presents a comprehensive analysis of the evolution of artificial neuron implementations from conventional CMOS to emerging post‐CMOS technologies.
Kannan Udaya Mohanan +4 more
wiley +1 more source
Advanced Materials, EarlyView.The perspective presents an integrated view of neuromorphic technologies, from device physics to real‐time applicability, while highlighting the necessity of full‐stack co‐optimization. By outlining practical hardware‐level strategies to exploit device behavior and mitigate non‐idealities, it shows pathways for building efficient, scalable, and ...
Kapil Bhardwaj +8 more
wiley +1 more source