Zobrazeno 1 - 10
of 731
pro vyhledávání: '"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
Let $G$ be a strongly connected and balanced directed graph. The Laplacian matrix of $G$ is then the matrix (not necessarily symmetric) $L:=D-A$, where $A$ is the adjacency matrix of $G$ and $D$ is the diagonal matrix such that the row sums and the c
Externí odkaz:
http://arxiv.org/abs/1906.01165
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 20, Iss 2, Pp 106-107 (2023)
Externí odkaz:
https://doaj.org/article/dbea89697e724ba2ba13e8d8a256e14d
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
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 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:
Annals of Operations Research. 315:623-628
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b4079a033ad5e01c0e15966ac190acb2
https://doi.org/10.1007/s10479-022-04872-4
https://doi.org/10.1007/s10479-022-04872-4
Publikováno v:
International Game Theory Review.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::34df27c25fdaaa003d0d6bcf596d7f5e
https://doi.org/10.1142/s0219198923020012
https://doi.org/10.1142/s0219198923020012
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
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