Results 21 to 30 of about 4,385,040 (261)
The Kirchhoff index and spanning trees of Möbius/cylinder octagonal chain
Discrete Applied Mathematics, 2022 Jia-bao Liu +3 more
semanticscholar +3 more sources
On the Kirchhoff matrix, a new Kirchhoff index and the Kirchhoff energy [PDF]
Journal of Inequalities and Applications, 2013 The main purpose of this paper is to define and investigate the Kirchhoff matrix, a new Kirchhoff index, the Kirchhoff energy and the Kirchhoff Estrada index of a graph. In addition, we establish upper and lower bounds for these new indexes and energy. In the final section, we point out a new possible application area for graphs by considering this new
CANGÜL, İSMAİL NACİ +3 more
openaire +5 more sources
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
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
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
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
Kirchhoff index of a non-complete wheel [PDF]
, 2016 In this work, we compute analitycally the Kirchhoff index and effective resistances of a weighted non–complete wheel that has been obtained by adding a vertex to a weighted cycle and some edges conveniently chosen.
Gago Álvarez, Silvia
core +2 more sources
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