Results 11 to 20 of about 9,193,291 (353)
Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph [PDF]
Journal of the European Mathematical Society, 2017 In this paper we relate a fundamental parameter of a random graph, its degree sequence, to a simple model of nearly independent binomial random variables. This confirms a conjecture made in 1997.
Anita Liebenau, N. Wormald
semanticscholar +3 more sources
A Degree Sequence Komlós Theorem [PDF]
SIAM Journal on Discrete Mathematics, 2018 An important result of Koml\'os [Tiling Tur\'an theorems, Combinatorica, 2000] yields the asymptotically exact minimum degree threshold that ensures a graph $G$ contains an $H$-tiling covering an $x$th proportion of the vertices of $G$ (for any fixed $x \
Joseph Hyde, Hong Liu, Andrew Treglown
semanticscholar +4 more sources
Extremal Trees with Fixed Degree Sequence [PDF]
The Electronic Journal of Combinatorics, 2020 The greedy tree $\mathcal{G}(D)$ and the $\mathcal{M}$-tree $\mathcal{M}(D)$ are known to be extremal among trees with degree sequence $D$ with respect to various graph invariants.
E. Andriantiana +2 more
semanticscholar +6 more sources
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 +3 more sources
Functions on adjacent vertex degrees of trees with given degree sequence
Open Mathematics, 2014 In this note we consider a discrete symmetric function f(x, y) where $$f(x,a) + f(y,b) \geqslant f(y,a) + f(x,b) for any x \geqslant y and a \geqslant b,$$ associated with the degrees of adjacent vertices in a tree. The extremal trees with respect to the
Wang Hua
doaj +2 more sources
Degree sequences and majorization
Linear Algebra and its Applications, 1994 AbstractA classical result concerning majorization is: given two nonnegative integer sequences a and b such that a majorizes b, a rearrangement of b can be obtained from a by a sequence of unit transformations. A recent result says that a degree sequence is a threshold sequence (degree sequence of a threshold graph) if and only if it is not strictly ...
Srinivasa R. Arikati, Uri N. Peled
openalex +3 more sources
Self-dual polyhedra of given degree sequence [PDF]
The Art of Discrete and Applied Mathematics, 2021 Given vertex valencies admissible for a self-dual polyhedral graph, we describe an algorithm to explicitly construct such a polyhedron. Inputting in the algorithm permutations of the degree sequence can give rise to non-isomorphic graphs.
Riccardo W. Maffucci
semanticscholar +1 more source
Reciprocity of networks with degree correlations and arbitrary degree sequences [PDF]
Physical Review E, 2008 8 pages, 3 figures, added a new table and a new figure, accepted for publication in Phys.Rev ...
Gorka Zamora‐López +4 more
openalex +6 more sources
ITM Web of Conferences, 2020 Special numbers have very important mathematical properties alongside their numerous applications in many fields of science. Probably the most important of those is the Fibonacci numbers.
Demirci Musa, Cangul Ismail Naci
doaj +1 more source
The degree of asymmetry of sequences
Enumerative Combinatorics and Applications, 2021 We explore the notion of degree of asymmetry for integer sequences and related combinatorial objects. The degree of asymmetry is a new combinatorial statistic that measures how far an object is from being symmetric. We define this notion for compositions, words, matchings, binary trees and permutations, we find generating functions enumerating these ...
Sergi Elizalde, Emeric Deutsch
openaire +3 more sources