Zobrazeno 1 - 10
of 321
pro vyhledávání: '"Azimi, Ali"'
$\newcommand{\Max}{\mathrm{Max4PC}}$ The Four point condition (4PC henceforth) is a well known condition characterising distances in trees $T$. Let $w,x,y,z$ be four vertices in $T$ and let $d_{x,y}$ denote the distance between vertices $x,y$ in $T$.
Externí odkaz:
http://arxiv.org/abs/2308.08237
We give explicit formulas for resistance distance matrices and Moore-Penrose inverses of incidence and Laplacian matrices of ladder, circular ladder, and M\"{o}bius ladder graphs. As a result, we compute the Kirchhoff index of these graphs and give n
Externí odkaz:
http://arxiv.org/abs/2306.10497
We present explicit formulas for Moore-Penrose inverses of some families of set inclusion matrices arising from sets, vector spaces, and designs.
Comment: 8 pages
Comment: 8 pages
Externí odkaz:
http://arxiv.org/abs/2305.12929
Publikováno v:
Special Matrices, Vol 12, Iss 1, Pp 133-150 (2024)
Formulas for the determinant of distance matrix DT{D}_{T} of tree TT are known in the unweighted case and in the case when the edges of TT have commuting variable weights. Associated with the four-point condition (4PC) and a tree TT are two matrices,
Externí odkaz:
https://doaj.org/article/7b093b69ffc54c6f8f455295e1414f1e
Autor:
Sanie-Jahromi, Fatemeh, Azimi, Ali, Hassanipour, Hamidreza, Bostanian, Pardis, Khademi, Behzad
Publikováno v:
In European Journal of Integrative Medicine September 2024 70
Publikováno v:
In Results in Chemistry August 2024 10
For a connected graph $G:=(V,E)$, the Steiner distance $d_G(X)$ among a set of vertices $X$ is the minimum size among all the connected subgraphs of $G$ whose vertex set contains $X$. The $k-$Steiner distance matrix $D_k(G)$ of $G$ is a matrix whose
Externí odkaz:
http://arxiv.org/abs/2108.12798
Publikováno v:
In Analytica Chimica Acta 22 June 2024 1309
Publikováno v:
In Linear Algebra and Its Applications 15 June 2024 691:133-150
Publikováno v:
Sexuality & Culture. Apr2024, Vol. 28 Issue 2, p733-748. 16p.