Related papers: A Relation on ${(\omega, <)}$ of Intermediate Degr…
We provide a general framework for analyzing degree correlations between nodes separated by more than one step (i.e., beyond nearest neighbors) in complex networks. One probability and four conditional probabilities are introduced to fully…
In this paper we construct a class of bounded degree bipartite graphs with a small separator and large bandwidth. Furthermore, we also prove that graphs from this class are spanning subgraphs of graphs with minimum degree just slightly…
A computable structure $\mathcal{A}$ has degree of categoricity $\mathbf{d}$ if $\mathbf{d}$ is exactly the degree of difficulty of computing isomorphisms between isomorphic computable copies of $\mathcal{A}$. Fokina, Kalimullin, and Miller…
The notion of computable reducibility between equivalence relations on the natural numbers provides a natural computable analogue of Borel reducibility. We investigate the computable reducibility hierarchy, comparing and contrasting it with…
The finite spectrum of a first-order sentence is the set of positive integers that are the sizes of its models. The class of finite spectra is known to be the same as the complexity class NE. We consider the spectra obtained by limiting…
In this work, we delve into the study of the 2-switch-degree of a graph $G$, which is nothing more than the degree of $G$ as a vertex of the realization graph $\mathcal{G}(d)$ associated with the degree sequence $d$ of $G$. We explore the…
The degrees are a classical and relevant way to study the topology of a network. They can be used to assess the goodness-of-fit for a given random graph model. In this paper we introduce goodness-of-fit tests for two classes of models.…
There are typically several nonisomorphic graphs having a given degree sequence, and for any two degree sequence terms it is often possible to find a realization in which the corresponding vertices are adjacent and one in which they are…
Subshifts are shift invariant closed subsets of $\Sigma^{\mathbb{Z}^d}$ , minimal subshifts are subshifts in which all points contain the same patterns. It has been proved by Jeandel and Vanier that the Turing degree spectra of non-periodic…
The network topology can be described by the number of nodes and the interconnections among them. The degree of a node in a network is the number of connections it has to other nodes and the degree distribution is the probability…
Let $\mathbb{G}^{D}$ be the set of graphs $G(V,\, E)$ with $\left|V\right|=n$, and the degree sequence equal to $D=(d_{1},\, d_{2},\,\dots,\, d_{n})$. In addition, for $\frac{1}{2}<a<1$, we define the set of graphs with an almost given…
Correlation between nodes is found to be a common and important property in many complex networks. Here we investigate degree correlations of the Barabasi-Albert (BA) Scale-Free model with both analytical results and simulations, and find…
The degree/diameter problem is the problem of finding the largest possible number of vertices $n_{\Delta,D}$ in a graph of given degree $\Delta$ and diameter $D$. We consider the problem for the case of diameter $D=2$. William G Brown gave…
The degree-constrained subgraph problem asks for a subgraph of a given graph such that the degree of each vertex is within some specified bounds. We study the following reconfiguration variant of this problem: Given two solutions to a…
The purpose of this paper is to analyze the degree index and clustering index in random graphs. The degree index in our setup is a certain measure of degree irregularity whose basic properties are well studied in the literature, and the…
It is known that degrees of basic relative invariants of homogeneous open convex cones of rank $r$ are less than or equal to $2^{r-1}$. In this article, we show that there exists a homogeneous cone of rank $r$ one of whose basic relative…
Let $k$ be a field of positive characteristic $p$, $R$ be a Gorenstein graded $k$-algebra, and $S=R/J$ be an artinian quotient of $R$ by a homogeneous ideal. We ask how the socle degrees of $S$ are related to the socle degrees of…
Real-world networks often exhibit strong transitivity with nontrivial local clustering spectra and degree correlations. Such features are not easily modeled in tractable network models, creating an obstacle to the theoretical understanding…
A computable structure A is x-computably categorical for some Turing degree x, if for every computable structure B isomorphic to A there is an isomorphism f:B -> A with f computable in x. A degree x is a degree of categoricity if there is a…
Let $G$ be a connected graph with maximum degree $\Delta$. Brooks' theorem states that $G$ has a $\Delta$-coloring unless $G$ is a complete graph or an odd cycle. A graph $G$ is \emph{degree-choosable} if $G$ can be properly colored from…