相关论文: Solving the Mostar index inverse problem

We provide a theory to establish the existence of nonzero solutions of perturbed Hammerstein integral equations with deviated arguments, being our main ingredient the theory of fixed point index. Our approach is fairly general and covers a…

A graph is called homogeneously traceable if every vertex is an endpoint of a Hamilton path. In 1979 Chartrand, Gould and Kapoor proved that for every integer $n\ge 9,$ there exists a homogeneously traceable nonhamiltonian graph of order…

We consider the algebra of invariants of $d$-tuples of $n\times n$ matrices under the action of the orthogonal group by simultaneous conjugation over an infinite field of characteristic $p$ different from two. It is well-known that this…

We present an algorithm for solving inverse problems on graphs analogous to those arising in diffuse optical tomography for continuous media. In particular, we formulate and analyze a discrete version of the inverse Born series, proving…

This paper develops 'covariant tomography', a local framework for solving Inverse Boundary Value Problems (IBVP) for parallel transport equation on star-shaped domains. By integrating geometric decomposition with specific interior…

Let $G$ be a bipartite graph and its adjacency matrix $\mathbb A$. If $G$ has a unique perfect matching, then $\mathbb A$ has an inverse $\mathbb A^{-1}$ which is a symmetric integral matrix, and hence the adjacency matrix of a multigraph.…

The matching polytope of a graph $G$ is the convex hull of the indicator vectors of the matchings on $G$. We characterize the graphs whose associated matching polytopes are Gorenstein, and then prove that all Gorenstein matching polytopes…

In this paper, we study the inverse spectral problem for the Sturm-Liouville operators on a star-shaped graph, which consists in the recovery of the potentials from specral data or several spectra. The uniform stability of these inverse…

Given an unknown $n \times n$ matrix $A$ having non-negative entries, the \emph{inner product} (IP) oracle takes as inputs a specified row (or a column) of $A$ and a vector $v \in \mathbb{R}^{n}$, and returns their inner product. A…

High dimensional covariance estimation and graphical models is a contemporary topic in statistics and machine learning having widespread applications. An important line of research in this regard is to shrink the extreme spectrum of the…

Let ${\mathcal G}_n$ be the set of class of graphs of order $n$. The first Zagreb index $M_1(G)$ is equal to the sum of squares of the degrees of the vertices, and the second Zagreb index $M_2(G)$ is equal to the sum of the products of the…

In this article, the inverse scattering problem (ISP) of recovering the matrix coefficient of a first order system of ordinary differential equations on the half-axis from its scattering matrix is considered. In the case of a triangular…

In this paper the complete spectral analysis of the operators is carried out and also with help of generalized normalizing numbers the inverse problem is solved.

Mariusz Meszka has conjectured that given a prime p=2n+1 and a list L containing n positive integers not exceeding n there exists a near 1-factor in K_p whose list of edge-lengths is L. In this paper we propose a generalization of this…

This work concerns results on conditions guaranteeing that certain banded $M$-matrices have banded inverses. As a first goal, a graph theoretic characterization for an off-diagonal entry of the inverse of an $M$-matrix to be positive, is…

It was recently shown \cite{STV} that satisfiability is polynomially solvable when the incidence graph is an interval bipartite graph (an interval graph turned into a bipartite graph by omitting all edges within each partite set). Here we…

A positive function (conductivity) on the edges of a graph induces the Dirichlet-to- Neumann map between boundary values of harmonic functions. The inverse conductivity problem is to find the conductivity from the Dirichlet-to-Neumann map.…

This article examines the inverse problem for a lossy quantum graph that is internally excited and sensed. In particular, we supply an algorithmic methodology for deducing the topology and geometric structure of the underlying metric graph.…

By a result of Horv\'ath the equation solvability problem over finite nilpotent groups and rings is in P. We generalize his result, showing that the equation solvability over every finite supernilpotent Mal'cev algebra is in P. We also give…

We are interested in the inverse problem of recovering a Robin coefficient defined on some non accessible part of the boundary from available data on another part of the boundary in the nonstationary Stokes system. We prove a Lipschitz…