Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0905.4892

Degree-based graph construction

Hyunju Kim·Zoltan Toroczkai·Péter L. Erdős·István Miklós·László Á. Székely
View original source ↗Read source document ↗Export metadata ↓

Abstract

Degree-based graph construction is an ubiquitous problem in network modeling, ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This problem includes existence, enumeration, exhaustive construction and sampling questions with aspects that are still open today. Here we give necessary and sufficient conditions for a sequence of nonnegative integers to be realized as a simple graph's degree sequence, such that a given (but otherwise arbitrary) set of connections from a arbitrarily given node are avoided. We then use this result to present a swap-free algorithm that builds {\em all} simple graphs realizing a given degree sequence. In a wider context, we show that our result provides a greedy construction method to build all the $f$-factor subgraphs embedded within $K_n\setminus S_k$, where $K_n$ is the complete graph and $S_k$ is a star graph centered on one of the nodes.

Explore related subjects

math.COcond-mat.dis-nn

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hyunju Kim, Zoltan Toroczkai, Péter L. Erdős, István Miklós, László Á. Székely. 2009-08-25. Degree-based graph construction. https://arxiv.org/abs/0905.4892

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗