相关论文: The sandwich theorem

The {\it Randi\'c index} $R(G)$ of a graph $G$ is defined as the sum of 1/\sqrt{d_ud_v} over all edges $uv$ of $G$, where $d_u$ and $d_v$ are the degrees of vertices $u$ and $v,$ respectively. Let $D(G)$ be the diameter of $G$ when $G$ is…

Lov\'asz conjectured that every connected 4-regular planar graph G admits a realization as a system of circles, i.e., it can be drawn on the plane utilizing a set of circles, such that the vertices of G correspond to the intersection and…

Korsky, Saffat and Aiylam introduced a growth constant $c(G)$ for integer-valued $h$-Lipschitz functions on a finite graph $G$ and proved that, for $G=G(n,d/n)$, \[ \frac{1}{2d}+O(d^{-2})\le \log c(G)\le \frac{4\log^2 d}{d}+O(d^{-1}) \]…

The stable set problem and the graph coloring problem are classes of NP-hard optimization problems on graphs. It is well known that even near-optimal solutions for these problems are difficult to find in polynomial time. The Lov\'asz theta…

The aim of this work is to obtain new inequalities for the variable symmetric division deg index $SDD_\alpha(G) = \sum_{uv \in E(G)} (d_u^\alpha/d_v^\alpha+d_v^\alpha/d_u^\alpha)$, and to characterize graphs extremal with respect to them.…

In this work we attempt to count the number of integer-valued $h$-Lipschitz functions (functions that change by at most $h$ along edges) on two classes of sparse graphs; grid graphs $L_{m,n}$, and sparse random graphs $G(n,d/n)$. We find…

The subject of this work is the study of $\LS_+$-perfect graphs defined as those graphs $G$ for which the stable set polytope $\stab(G)$ is achieved in one iteration of Lov\'asz-Schrijver PSD-operator $\LS_+$, applied to its edge relaxation…

Lov\'{a}sz conjectured that every connected vertex-transitive graph contains a hamilton path in 1970. First we reveal the structure of connected vertex-transitive graphs with an odd number of vertices. Then we prove that every connected…

The functionality of a graph $G$ is the minimum number $k$ such that in every induced subgraph of $G$ there exists a vertex whose neighbourhood is uniquely determined by the neighborhoods of at most $k$ other vertices in the subgraph. The…

Motivated by the problem of zero-error broadcasting, we introduce a new notion of graph capacity, termed $\rho$-capacity, that generalizes the Shannon capacity of a graph. We derive upper and lower bounds on the $\rho$-capacity of arbitrary…

In the 1970s, Gy\H{o}ri and Lov\'{a}sz showed that for a $k$-connected $n$-vertex graph, a given set of terminal vertices $t_1, \dots, t_k$ and natural numbers $n_1, \dots, n_k$ satisfying $\sum_{i=1}^{k} n_i = n$, a connected vertex…

Lov\'asz (1987) proved that every matching covered graph $G$ may be uniquely decomposed into a list of bricks (nonbipartite) and braces (bipartite); we let $b(G)$ denote the number of bricks. An edge $e$ is removable if $G-e$ is also…

We investigate novel random graph embeddings that can be computed in expected polynomial time and that are able to distinguish all non-isomorphic graphs in expectation. Previous graph embeddings have limited expressiveness and either cannot…

The analysis of signals defined over a graph is relevant in many applications, such as social and economic networks, big data or biological networks, and so on. A key tool for analyzing these signals is the so called Graph Fourier Transform…

We prove a lower bound to quantum Max Cut of a graph in terms of the Lov\'asz theta function of its complement. For a graph with $m$ edges, $\text{qmc}(G) \geq \tfrac{m}{4}\big( 1 + \tfrac{8}{3\pi}\tfrac{1}{\vartheta(\bar{G}) -1} \big)$,…

Let $\mathcal{G} = \{G_1 = (V, E_1), \dots, G_m = (V, E_m)\}$ be a collection of $m$ graphs defined on a common set of vertices $V$ but with different edge sets $E_1, \dots, E_m$. Informally, a function $f :V \rightarrow \mathbb{R}$ is…

The Lov\'asz complex $L(G)$ of a graph $G$ is a deformation retract of its neighborhood complex, equipped with a canonical $Z_2$-action. We show that, under mild assumptions, $L(G)$ is homeomorphic to a surface if and only if $G$ is a…

We present the theory of multifunctions applied to graphs. Its interesting feature is that walks are recognized as iterations. We consider the graphs with arbitrary number of vertices which are determined by multifunctions. The mutually…

For an undirected, simple, finite, connected graph $G$, we denote by $V(G)$ and $E(G)$ the sets of its vertices and edges, respectively. A function $\varphi:E(G)\rightarrow \{1,...,t\}$ is called a proper edge $t$-coloring of a graph $G$,…

The Wiener index of a graph $W(G)$ is a well studied topological index for graphs. An outstanding problem of \v{S}olt{\'e}s is to find graphs $G$ such that $W(G)=W(G-v)$ for all vertices $v\in V(G)$, with the only known example being…