Related papers: On Realizations of a Joint Degree Matrix

In this paper, we prove that every graph with average degree at least $s+t+2$ has a vertex partition into two parts, such that one part has average degree at least $s$, and the other part has average degree at least $t$. This solves a…

For a given multigraph H, a graph G is H-linked, if |G| \geq |H| and for every injective map {\tau}: V (H) \rightarrow V (G), we can find internally disjoint paths in G, such that every edge from uv in H corresponds to a {\tau} (u) - {\tau}…

We give an upper bound on the number of perfect matchings in an undirected simple graph $G$ with an even number of vertices, in terms of the degrees of all the vertices in $G$. This bound is sharp if $G$ is a union of complete bipartite…

In this paper, the synchronization in a hyper-network of coupled dynamical systems is investigated for the first time. An evolving hyper-network model is proposed for better describing some complex systems. A concept of joint degree is…

We consider graph Turing machines, a model of parallel computation on a graph, in which each vertex is only capable of performing one of a finite number of operations. This model of computation is a natural generalization of several…

In a directed graph, the imbalance of a vertex is its outdegree minus its indegree. We characterize the sequences that are realizable as the sequence of imbalances of a simple directed graph. Moreover, a realization of a realizable sequence…

We give a description of degree-one maps between closed, oriented 3-manifolds in terms of surgery. Namely, we show that there is a degree-one map from a closed, oriented 3-manifold $M$ to a closed, oriented 3-manifold $N$ if and only if $M$…

We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…

Vertex connectivity and edge connectivity are fundamental concepts in graph theory that have been widely studied from both structural and algorithmic perspectives. The focus of this paper is on computing these two parameters for graphs…

We introduce a notion of compatibility for multiplicity matrices. This gives rise to a necessary condition for the join of two (possibly disconnected) graphs $G$ and $H$ to be the pattern of an orthogonal symmetric matrix, or equivalently,…

We discuss the problem of embedding graphs in the plane with restrictions on the vertex mapping. In particular, we introduce a technique for drawing planar graphs with a fixed vertex mapping that bounds the number of times edges bend. An…

Let G be a simple graph without isolated vertices. For a vertex i in G, the degree d_i is the number of vertices adjacent to i and the average 2-degree m_i is the mean of the degrees of the vertices which are adjacent to i. The sequence of…

We optimize multiway equijoins on relational tables using degree information. We give a new bound that uses degree information to more tightly bound the maximum output size of a query. On real data, our bound on the number of triangles in a…

The independent set on a graph $G=(V,E)$ is a subset of $V$ such that no two vertices in the subset have an edge between them. The MIS problem on $G$ seeks to identify an independent set with maximum cardinality, i.e. maximum independent…

Let $X_1,X_2,...$ be an infinite sequence of i.i.d. random vectors distributed exponentially with parameter $\lam .$ For each $y$ and $n\geq 1,$ form a graph $G_n(y)$ with vertex set $V_n = \{X_1,...,X_n\},$ two vertices are connected if…

The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…

This work considers the distributed computation of the one-to-one vertex correspondences between two undirected and connected graphs, which is called \textit{graph matching}, over multi-agent networks. Given two \textit{isomorphic} and…

For a given permutation $\pi_n$ in $S_n$, a random permutation graph is formed by including an edge between two vertices $i$ and $j$ if and only if $(i - j) (\pi_n(i) - \pi_n (j)) < 0$. In this paper, we study various statistics of random…

Vertex splitting is a graph modification operation in which a vertex is replaced by multiple vertices such that the union of their neighborhoods equals the neighborhood of the original vertex. We introduce and study vertex splitting as a…

For a degree sequence, we define the set of edges that appear in every labeled realization of that sequence as forced, while the edges that appear in none as forbidden. We examine structure of graphs whose degree sequences contain either…