Related papers: Determinants of weighted path matrices
The k-th power D^k of a directed graph D is defined to be the directed graph on the vertices of D with an arc from a to b in D^k iff one can get from a to b in D with exactly k steps. This notion is equivalent to the k-fold composition of…
We consider matrices whose elements enumerate weights of walks in planar directed weighted graphs (not necessarily acyclic). These matrices are totally nonnegative; more precisely, all their minors are formal power series in edge weights…
In this article, we shall derive by elementary calculations the Gauss map, spherical image, Weingarten map and the curvatures at identity of the special linear group, that is, the matrices of determinant 1. We could not find any reference…
We show that the directed labelled Cayley graphs coincide with the rooted deterministic vertex-transitive simple graphs. The Cayley graphs are also the strongly connected deterministic simple graphs of which all vertices have the same cycle…
We introduce a flow condition on open graph states (graph states with inputs and outputs) which guarantees globally deterministic behavior of a class of measurement patterns defined over them. Dependent Pauli corrections are derived for all…
Rubei et. al., established results for the distance matrix of positive weighted Petersen graphs. Focusing on the properties of the distance matrix, we generalized positive weighted Petersen graphs results to Kneser graphs. We analyzed…
In this paper, we treat some weighted line digraphs which are induced by a connected and undirected graph. For a given graph $G$, the adjacency matrix of the weighted line digraph $W$ is determined by a boundary operator from an arc-based…
A weighted coloured-edge graph is a graph for which each edge is assigned both a positive weight and a discrete colour, and can be used to model transportation and computer networks in which there are multiple transportation modes. In such…
We investigate the Drazin invertibility of adjacency matrices associated with a class of oriented graphs known as oriented Dutch windmill graphs. By analyzing walks of prescribed lengths and exploiting the structure of the minimal…
Let G=(V,E) be a graph with f:V\to Z_+ a function assigning degree bounds to vertices. We present the first efficient algebraic algorithm to find an f-factor. The time is \tilde{O}(f(V)^{\omega}). More generally for graphs with integral…
Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles…
Consider a weighted graph G with n vertices, numbered by the set {1,...,n}. For any path p in G, we call w_G(p) the sum of the weights of the edges of the path and we define the multiset {\cal D}_{i,j} (G) = {w_G(p) | p simple path between…
Grassmann (or anti-commuting) variables are extensively used in theoretical physics. In this paper we use Grassmann variable calculus to give new proofs of celebrated combinatorial identities such as the Lindstr\"om-Gessel-Viennot formula…
In recent works, [20],[21], descendent integrals on the moduli space of Riemann surfaces with boundary were defined. It was conjectured in [20] that the generating function of these integrals satisfies the open KdV equations. In this paper…
We show that weighted path orders are special instances of a variant of semantic path orders. Exploiting this fact, we introduce a generalization of weighted path orders that goes beyond the realm of simple termination. Experimental data…
Notions of minimal sufficient causation are incorporated within the directed acyclic graph causal framework. Doing so allows for the graphical representation of sufficient causes and minimal sufficient causes on causal directed acyclic…
This note contains a new combinatorial proof of Cramer's rule based on the Gessel-Viennot-Lindstrom Lemma.
Python implementation of selected weighted graph algorithms is presented. The minimal graph interface is defined together with several classes implementing this interface. Graph nodes can be any hashable Python objects. Directed edges are…
This paper is intended to give closed formulae for binomial determinants with consecutive or almost consecutive rows or columns, as well as calculating the generator of left nullspaces defined by some binomial matrices. In the meantime, we…
In this paper it is shown that it is possible to associate several polynomial ideals to a directed graph $D$ in order to find properties of it. In fact by using algebraic tools it is possible to give appropriate procedures for automatic…