Zobrazeno 1 - 10
of 166
pro vyhledávání: '"Ravindra B. Bapat"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 20, Iss 2, Pp 108-114 (2023)
Abstract–In this article, some interesting applications of generalized inverses in the graph theory are revisited. Interesting properties of generalized inverses are employed to make the proof of several known results simpler, and several technique
Externí odkaz:
https://doaj.org/article/8f5e762da813419dba6ad55f0523ab21
Autor:
Ravindra B. Bapat
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 7, Iss 2, Pp 301-313 (2019)
Let T be a tree with vertex set {1, …, n} such that each edge is assigned a nonzero weight. The squared distance matrix of T, denoted by Δ, is the n × n matrix with (i, j)-element d(i, j)2, where d(i, j) is the sum of the weights of the edges on
Externí odkaz:
https://doaj.org/article/c347f956ec5a4354ab7152815c3d3529
This volume provides recent developments and a state-of-the-art review in various areas of mathematical modeling, computation and optimization. It contains theory, computation as well as the applications of several mathematical models to problems in
This edited book presents recent developments and state-of-the-art review in various areas of mathematical programming and game theory. It is a peer-reviewed research monograph under the ISI Platinum Jubilee Series on Statistical Science and Interdis
Publikováno v:
Linear Algebra and its Applications. 631:254-281
Let G be a labeled, connected, bipartite graph with the bi-partition ( L = { l 1 , … , l k } , R = { r 1 , … , r p } ) of the vertex set V. Let D be the usual distance matrix of G, where rows and columns are indexed by l 1 , … , l k , r 1 , …
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca1748d0386a7c4e7d72f9bb46bb6824
https://doi.org/10.1016/j.laa.2021.09.001
https://doi.org/10.1016/j.laa.2021.09.001
Publikováno v:
Journal of Algebra and Its Applications.
In this paper, several existing results related to secondary transpose are critically reviewed and a result analogous to spectral decomposition theorem is obtained for a real secondary symmetric matrix. Noting that Moore–Penrose inverse with refere
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f0c5fe59834f852b72308ff38ce2772
https://doi.org/10.1142/s021949882450052x
https://doi.org/10.1142/s021949882450052x
Publikováno v:
Linear and Multilinear Algebra. 70:6908-6929
Euclidean distance matrices (EDM) are symmetric nonnegative matrices with several interesting properties. In this article, we introduce a wider class of matrices called generalized Euclidean distance matrices (GDMs) that include EDMs. Each GDM is an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b67900989128026e04101d597852769a
https://doi.org/10.1080/03081087.2021.1972083
https://doi.org/10.1080/03081087.2021.1972083
Publikováno v:
Linear Algebra and its Applications. 610:274-292
Let n ≥ 4 be an even integer and W n be the wheel graph with n vertices. The distance d i j between any two distinct vertices i and j of W n is the length of the shortest path connecting i and j. Let D be the n × n symmetric matrix with diagonal e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cba7f41b7a87705a3bd51383810e8eb0
https://doi.org/10.1016/j.laa.2020.10.003
https://doi.org/10.1016/j.laa.2020.10.003
Publikováno v:
Linear and Multilinear Algebra. 70:3370-3401
Let W n denote the wheel graph having n-vertices. If i and j are any two vertices of W n , define d i j := 0 if i = j 1 if i and j are adjacent 2 else . Let D be the n × n matrix with ( i , j ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d368e2a27f343b8ce95bc1db64df0f8
https://doi.org/10.1080/03081087.2020.1840499
https://doi.org/10.1080/03081087.2020.1840499
Publikováno v:
Linear Algebra and its Applications. 603:301-312
The four point theorem is a condition for distances to arise from trees. Based on this condition, for any tree T on n vertices, we associate an ( n 2 ) × ( n 2 ) matrix M T . We find the rank and the Smith Normal Form (SNF) of the matrix M T and sho
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::013863d597dae4009622993a36ea06bd
https://doi.org/10.1016/j.laa.2020.05.035
https://doi.org/10.1016/j.laa.2020.05.035