Results 11 to 20 of about 2,153 (243)
Enumeration of the Additive Degree–Kirchhoff Index in the Random Polygonal Chains
Axioms, 2022 The additive degree–Kirchhoff index is an important topological index. This paper we devote to establishing the explicit analytical expression for the simple formulae of the expected value of the additive degree–Kirchhoff index in a random polygon. Based
Xianya Geng, Wanlin Zhu
doaj +1 more source
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
Comparison of the Wiener and Kirchhoff Indices of Random Pentachains
Journal of Mathematics, 2021 Let G be a connected (molecule) graph. The Wiener index WG and Kirchhoff index KfG of G are defined as the sum of distances and the resistance distances between all unordered pairs of vertices in G, respectively.
Shouliu Wei +3 more
doaj +1 more source
Retraction Note: On the Kirchhoff matrix, a new Kirchhoff index and the Kirchhoff energy [PDF]
Journal of Inequalities and Applications, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maden, Ayse Dilek +3 more
openaire +1 more source
On relation between the Kirchhoff index and number of spanning trees of graph [PDF]
Communications in Combinatorics and Optimization, 2020 Let $G$ be a simple connected graph with degree sequence $(d_1,d_2,\ldots, d_n)$ where $\Delta =d_1\geq d_2\geq\cdots\geq d_n=\delta >0$ and let $\mu_1\geq \mu_2\geq\cdots\geq\mu_{n-1}>\mu_n=0$ be the Laplacian eigenvalues of $G$.
Igor Milovanovic +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
On lower bounds for the Kirchhoff index [PDF]
Kragujevac Journal of Science, 2017 Let G be a simple graph of order n ≥ 2 with m edges. Denote by d1 ≥ d2 ≥ · · · ≥ dn > 0 the sequence of vertex degrees and by μ1 ≥ μ2 ≥ · · · ≥ μn−1 > μn = 0 the Laplacian eigenvalues of the graph G. Lower bounds for the Kirchhoff index, Kf(G) = n Σ −1 i=
Milovanović I.Ž. 0000-0003-2209-9606 +1 more
doaj +1 more source
Results on Resistance Distance and Kirchhoff Index of Graphs With Generalized Pockets
Frontiers in Physics, 2022 F, Hv are considered simple connected graphs on n and m + 1 vertices, and v is a specified vertex of Hv and u1, u2, … uk ∈ F. The graph G = G[F, u1, … , uk, Hv] is called a graph with k pockets, obtained by taking one copy of F and k copies of Hv and ...
Qun Liu, Jiaqi Li
doaj +1 more source
Kirchhoff index and degree Kirchhoff index of complete multipartite graphs
Discrete Applied Mathematics, 2017 The Kirchhoff index of a graph is defined as half of the sum of all effective resistance distances between any two vertices. Assuming a complete multipartite graph G, by methods from linear algebra we explicitly formulate effective resistance distances between any two vertices of G, and its Kirchhoff index. In rest of paper we explore extremal value of
Ravindra B. Bapat +2 more
openaire +3 more sources
A family of c-cyclic graphs with a Θ(|V|2log|V|) Kirchhoff index
Examples and Counterexamples, 2023 By means of a recurrence, we provide a family of c-cyclic graphs, c≥0, whose Kirchhoff index is Θ(|V|2log|V|).
José Luis Palacios
doaj +1 more source