Related papers: A generalized inverse for graphs with absorption
Network theory and inverse modeling are two standard tools of applied physics, whose combination is needed when studying the dynamical organization of spatially distributed systems from indirect measurements. However, the associated…
Since the day the core inverse has been known in a paper of Bakasarly and Trenkler, it has been widely researched. So far, there are four generalizations of this inverse for the case of matrices of an arbitrary index, namely, the BT…
In this article we consider resistance matrix of a connected graph. For unweighted graph we study some necessary and sufficient conditions for resistance regular graphs. Also we find some relationship between Laplacian matrix and resistance…
We construct the complete structural phase diagram of polymer adsorption at substrates with attractive stripe-like patterns in the parameter space spanned by the adsorption affinity of the stripes and temperature. Results were obtained by…
Graph transformations definable in logic can be described using the notion of transductions. By understanding transductions as a basic embedding mechanism, which captures the possibility of encoding one graph in another graph by means of…
In this work we derive an inversion formula for the Laplace transform of a density observed on a curve in the complex domain, which generalizes the well known Post-Widder formula. We establish convergence of our inversion method and derive…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
Let G be an undirected graph on n vertices and let S(G) be the set of all real symmetric n x n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. The inverse inertia problem for G…
In this paper, we hope to bring closer graph theory and consensus algorithms. Firstly, we give a brief introduction to graph theory by listing a concise definition. Then we analyze and visualize some commonly used graphs. Secondly, we…
Distance matrices of some star like graphs are investigated in \cite{JAK}. These graphs are trees which are stars, wheel graphs, helm graphs and gear graphs. Except for gear graphs in the above list of star like graphs, there are precise…
We present a generalization of the inverse mapping theorem, where variations of a weaker non-expansiveness property (referred to as property ${\sf A}$) replace the key $\mathsf{C}^1$ condition. We also obtain inverse mapping theorems that…
Gravity inversion allows us to constrain the interior mass distribution of a planetary body using the observed shape, rotation, and gravity. Traditionally, techniques developed for gravity inversion can be divided into Monte Carlo methods,…
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…
Metric graph properties lie in the heart of the analysis of complex networks, while in this paper we study their convexity through mathematical definition of a convex subgraph. A subgraph is convex if every geodesic path between the nodes…
The walk distances in graphs are defined as the result of appropriate transformations of the $\sum_{k=0}^\infty(tA)^k$ proximity measures, where $A$ is the weighted adjacency matrix of a connected weighted graph and $t$ is a sufficiently…
Graphs are fundamental data structures which concisely capture the relational structure in many important real-world domains, such as knowledge graphs, physical and social interactions, language, and chemistry. Here we introduce a powerful…
In this paper we discuss graph inverse semigroups which are constucted from a directed graphs and study several interesting properties of graph inverse semigroups such as the nature of its idempotents, the structure of semilattice of…
The general solution of the inverse Frobenius-Perron problem considering the construction of a fully chaotic dynamical system with given invariant density is obtained within the class of one-dimensional unimodal maps. Some interesting…
In this paper we propose and study a new structural invariant for graphs, called distance-unbalanced\-ness, as a measure of how much a graph is (un)balanced in terms of distances. Explicit formulas are presented for several classes of…
In an oriented graph $\overrightarrow{G}$, the inversion of a subset $X$ of vertices is the operation that reverses the orientation of all arcs with both end-vertices in $X$. The inversion graph of a graph $G$, denoted by $\mathcal{I}(G)$,…