نتایج جستجو برای: kirchhoff index

تعداد نتایج: 398443  

2005
Alexey V. Borisov Ivan S. Mamaev

We consider the interaction of two vortex patches (elliptic Kirchhoff vortices) which move in an unbounded volume of an ideal incompressible fluid. A moment second-order model is used to describe the interaction. The case of integrability of a Kirchhoff vortex and a point vortex by the variable separation method is qualitatively analyzed. A new case of integrability of two Kirchhoff vortices is...

Let $G=(V,E)$, $V={1,2,ldots,n}$, $E={e_1,e_2,ldots,e_m}$,be a simple connected graph, with sequence of vertex degrees$Delta =d_1geq d_2geqcdotsgeq d_n=delta >0$ and Laplacian eigenvalues$mu_1geq mu_2geqcdotsgeqmu_{n-1}>mu_n=0$. Denote by $Kf(G)=nsum_{i=1}^{n-1}frac{1}{mu_i}$ and $t=t(G)=frac 1n prod_{i=1}^{n-1} mu_i$ the Kirchhoff index and number of spanning tree...

‎Let $G$ be a graph without an isolated vertex‎, ‎the normalized Laplacian matrix $tilde{mathcal{L}}(G)$‎ ‎is defined as $tilde{mathcal{L}}(G)=mathcal{D}^{-frac{1}{2}}mathcal{L}(G)mathcal{D}^{-frac{1}{2}}$‎, where ‎$mathcal{D}$ ‎is a‎ diagonal matrix whose entries are degree of ‎vertices ‎‎of ‎$‎G‎$‎‎. ‎The eigenvalues of‎ $tilde{mathcal{L}}(G)$ are ‎called as ‎the ‎normalized Laplacian eigenva...

Journal: :Applied Mathematics and Computation 2021

We find closed form formulas for the Kemeny’s constant and Kirchhoff index cluster G1{G2} of two highly symmetric graphs G1, G2, in terms parameters original graphs. also discuss some necessary conditions a graph to be symmetric.

2010
E. Brian Davies Pavel Exner

Inspired by a recent result of Davies and Pushnitski, we study resonance asymptotics of quantum graphs with general coupling conditions at the vertices. We derive a criterion for the asymptotics to be of a non-Weyl character. We show that for balanced vertices with permutation-invariant couplings the asymptotics is non-Weyl only in case of Kirchhoff or anti-Kirchhoff conditions. For graphs with...

Journal: :Frontiers in Physics 2022

F , H v are considered simple connected graphs on n and m + 1 vertices, is a specified vertex of u 2 … k ∈ . The graph G = [ ] called with pockets, obtained by taking one copy copies then attaching the i th to 1, at In this article, closed-form formulas resistance distance Kirchhoff index in terms

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید