Results 11 to 20 of about 5,199,165 (252)
Largest component of subcritical random graphs with given degree sequence [PDF]
, 2023 We study the size of the largest component of two models of random graphs with prescribed degree sequence, the configuration model (CM) and the uniform model (UM), in the (barely) subcritical regime.
Coulson, Matthew John +3 more
core +1 more source
The principal Erdős–Gallai differences of a degree sequence [PDF]
, 2021 The Erdős–Gallai criteria for recognizing degree sequences of simple graphs involve a system of inequalities. Given a fixed degree sequence, we consider the list of differences of the two sides of these inequalities.
Barrus, Michael D., Michael D. Barrus
core +1 more source
The Random Plots Graph Generation Model for Studying Systems with Unknown Connection Structures
Entropy, 2022 We consider the problem of modeling complex systems where little or nothing is known about the structure of the connections between the elements. In particular, when such systems are to be modeled by graphs, it is unclear what vertex degree distributions
Evgeny Ivanko, Mikhail Chernoskutov
doaj +1 more source
Symmetric bipartite graphs and graphs with loops [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Grant Cairns, Stacey Mendan
doaj +1 more source
A General Computational Approach for Counting Labeled Graphs
Algorithms, 2022 This paper presents a general recursive formula to estimate the number of labeled graphs as well as details to evaluate the formula for the following graph properties: number of edges (graph density), degree sequence, degree distribution, classification ...
Ravi Goyal, Victor De Gruttola
doaj +1 more source
On the Grone-Merris conjecture [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Grone and Merris [GM94] conjectured that the Laplacian spectrum of a graph is majorized by its conjugate vertex degree sequence. We prove that this conjecture holds for a class of graphs including trees.
Tamon Stephen
doaj +1 more source
Spectral ordering and 2-switch transformations [PDF]
The American Journal of Combinatorics, 2022 We address the problem of ordering trees with the same degree sequence by their spectral radii. To achieve that, we consider 2-switch transformations which preserve the degree sequence and establish when the index decreases.
Elismar Oliveira +2 more
doaj +3 more sources
Integer points in the degree-sequence polytope [PDF]
, 2023 An integer vector $b \in \mathbb{Z}^d$ is a degree sequence if there exists a hypergraph with vertices $\{1,\dots,d\}$ such that each $b_i$ is the number of hyperedges containing $i$. The degree-sequence polytope $\mathscr{Z}^d$ is the convex hull of all
Pinchasi, Rom +2 more
core
Degree Sequences of Monocore Graphs
Discussiones Mathematicae Graph Theory, 2014 A k-monocore graph is a graph which has its minimum degree and degeneracy both equal to k. Integer sequences that can be the degree sequence of some k-monocore graph are characterized as follows. A nonincreasing sequence of integers d0, . . . , dn is the
Bickle Allan
doaj +1 more source
An Efficient Algorithm to Test Potential Bipartiteness of Graphical Degree Sequences
Theory and Applications of Graphs, 2021 As a partial answer to a question of Rao, a deterministic and customizable efficient algorithm is presented to test whether an arbitrary graphical degree sequence has a bipartite realization.
Kai Wang
doaj +1 more source