Product distance matrix of a graph and squared distance matrix of a tree
نویسندگان
چکیده
منابع مشابه
Product Distance Matrix of a Graph and Squared Distance Matrix of a Tree
Let G be a strongly connected, weighted directed graph. We define a product distance η(i, j) for pairs i, j of vertices and form the corresponding product distance matrix. We obtain a formula for the determinant and the inverse of the product distance matrix. The edge orientation matrix of a directed tree is defined and a formula for its determinant and its inverse, when it exists, is obtained....
متن کاملProduct distance matrix of a tree with matrix weights
Let T be a tree on n vertices and let the n− 1 edges e1, e2, . . . , en−1 have weights that are s× s matrices W1,W2, . . . ,Wn−1, respectively. For two vertices i, j, let the unique ordered path between i and j be pi,j = er1er2 . . . erk . Define the distance between i and j as the s × s matrix Ei,j = ∏k p=1Wep . Consider the ns × ns matrix D whose i, j-th block is the matrix Ei,j . We give a f...
متن کاملEla the Product Distance Matrix of a Tree and a Bivariate Zeta Function of a Graph
In this paper, the product distance matrix of a tree is defined and formulas for its determinant and inverse are obtained. The results generalize known formulas for the exponential distance matrix. When the number of variables are restricted to two, the bivariate analogue of the laplacian matrix of an arbitrary graph is defined. Also defined in this paper is a bivariate analogue of the Ihara-Se...
متن کاملThe Product Distance Matrix of a Tree and a Bivariate Zeta Function of a Graph∗
We define the product distance matrix of a tree and obtain formulas for its determinant and inverse. The results generalize known formulas for the exponential distance matrix. When we restrict the number of variables to two, we are naturally led to define a bivariate analogue of the laplacian matrix of an arbitrary graph. We also define a bivariate analogue of the Ihara-Selberg zeta function an...
متن کاملRealizing the distance matrix of a graph
An explicit description is giv e n for th e uniqu e gra ph with as few arcs (eac h bearin g a positive length) as pos s ibl e, whi c h has a presc rib ed mat rix of s hortest-p ath di stan ces be twee n pa irs of distinct vertices. The sam e is d one in th e case wh e n the ith diago na l matrix e ntr y, in s te ad o f be ing zero , represents th e. le ngth of a s hort est c losed path co ntain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Analysis and Discrete Mathematics
سال: 2013
ISSN: 1452-8630,2406-100X
DOI: 10.2298/aadm130415006b