相关论文: A copositive formulation for the stability number …

It has been shown that the maximum stable set problem in some infinite graphs, and the kissing number problem in particular, reduces to a minimization problem over the cone of copositive kernels. Optimizing over this infinite dimensional…

In this paper, we study the relations between the numerical structure of the optimal solutions of a convex programming problem defined on the edge set of a simple graph and the stability number (i.e. the maximum size of a subset of pairwise…

This chapter investigates the cone of copositive matrices, with a focus on the design and analysis of conic inner approximations for it. These approximations are based on various sufficient conditions for matrix copositivity, relying on…

A graph with convex quadratic stability number is a graph for which the stability number is determined by solving a convex quadratic program. Since the very beginning, where a convex quadratic programming upper bound on the stability number…

There is a profound connection between copositive matrices and graph theory. Copositive matrices provide a powerful tool for formulating and solving various challenging graph-related problems. Conversely, graph theory provides a rich set of…

We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a…

This paper initiates a systematic study of connections between undirected colored graphs and associated two-variable stable polynomials obtained via Cauchy transform-type formulas. Examples of such stable polynomials have played crucial…

Graph parameters such as the clique number, the chromatic number, and the independence number are central in many areas, ranging from computer networks to linguistics to computational neuroscience to social networks. In particular, the…

A set of Pauli stings is well characterized by the graph that encodes its commutatitivity structure, i.e., by its frustration graph. This graph provides a natural interface between graph theory and quantum information, which we explore in…

Graph combinatorial optimization problems are widely applicable and notoriously difficult to compute; for example, consider the traveling salesman or facility location problems. In this paper, we explore the feasibility of using…

Given an input graph and weights on its vertices, the maximum co-2-plex problem is to find a subset of vertices maximizing the sum of their weights and inducing a graph of degree at most 1. In this article, we analyze polyhedral aspects of…

Optimization under uncertainty and risk is indispensable in many practical situations. Our paper addresses stability of optimization problems using composite risk functionals which are subjected to measure perturbations. Our main focus is…

We study the uniqueness of solutions to a class of heat equations with positive density posed on infinite weighted graphs. We separately consider the case when the density is bounded from below by a positive constant and the case of…

Woess \cite{Woess98} introduced a curvature notion on the set of edges of a planar graph, called $\Psi$-curvature in our paper, which is stable under the planar duality. We study geometric and combinatorial properties for the class of…

A graph $G$ is defined encapsulating the number theoretic notion of the Fundamental Theorem of Arithmetic. We then provide a graph theoretic approach to the fundamental results on the coprimality of two natural numbers, through the use of…

Frei et al. [6] showed that the problem to decide whether a graph is stable with respect to some graph parameter under adding or removing either edges or vertices is $\Theta_2^{\text{P}}$-complete. They studied the common graph parameters…

We present a sufficient condition for the stability property of extremal graph problems that can be solved via Zykov's symmetrisation. Our criterion is stated in terms of an analytic limit version of the problem. We show that, for example,…

We show that the problem of counting perfect matchings remains #P-complete even if we restrict the input to very dense graphs, proving the conjecture in [5]. Here "dense graphs" refer to bipartite graphs of bipartite independence number…

Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how to compare graphs. This problem is often formulated as a…

The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the…