Results 11 to 20 of about 5,011,430 (289)
A Degree Sequence Komlós Theorem [PDF]
SIAM Journal on Discrete Mathematics, 2019 20 pages, 4 figures. Author accepted manuscript.
Joseph Hyde +2 more
openaire +5 more sources
On the reconstruction of the degree sequence [PDF]
Discrete Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Charles Delorme +2 more
openaire +3 more sources
Degree sequence optimization and extremal degree enumerators
Discrete Applied MathematicsThe degree sequence optimization problem is to find a subgraph of a given graph which maximizes the sum of given functions evaluated at the subgraph degrees. Here we study this problem by replacing degree sequences, via suitable nonlinear transformations, by suitable degree enumerators, and we introduce suitable degree enumerator polytopes.
Onn, Shmuel
openaire +4 more sources
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 +1 more
core +1 more source
The clustering coefficient of a scale-free random graph [PDF]
, 2009 We consider a random graph process in which, at each time step, a new vertex is added with m out-neighbours, chosen with probabilities proportional to their degree plus a strictly positive constant.
Eggemann, N, Noble, S D
core +6 more sources
Packing Tree Degree Sequences [PDF]
Graphs and Combinatorics, 2019 AbstractA degree sequence is a list of non-negative integers, $${D = d_1, d_2, \ldots , d_n}$$D=d1,d2,…,dn. It is called graphical if there exists a simple graph G such that the degree of the ith vertex is $$d_i$$di; G is then said to be a realization of D. A tree degree sequence is one that is realized by a tree.
Kristóf Bérczi +3 more
openaire +7 more sources
Optimization over Degree Sequences [PDF]
SIAM Journal on Discrete Mathematics, 2018 We introduce and study the problem of optimizing arbitrary functions over degree sequences of hypergraphs and multihypergraphs. We show that over multihypergraphs the problem can be solved in polynomial time. For hypergraphs, we show that deciding if a given sequence is the degree sequence of a 3-hypergraph is NP-complete, thereby solving a 30 year ...
Antoine Deza +3 more
openaire +3 more sources
, 2019 Teorija grafova je od velikog značaja u različitim područjima znanosti. Jednostavni konačni grafovi predstavljaju značajnu vrstu grafova. U ovom završnom radu se razmatra niz stupnjeva konačnog jednostavnog grafa, pojam usko vezan uz osnovne elemente ...
Begović, Dolores
core +2 more sources
On the necessity of Chvátal’s Hamiltonian degree condition
AKCE International Journal of Graphs and Combinatorics, 2020 In 1972 Chvátal gave a well-known sufficient condition for a graphical sequence to be forcibly Hamiltonian, and showed that in some sense his condition is best possible.
Douglas Bauer +3 more
doaj +1 more source
The irregularity of two types of trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 The irregularity of a graph $G$ is defined as the sum of weights $|d(u)-d(v)|$ of all edges $uv$ of $G$, where $d(u)$ and $d(v)$ are the degrees of the vertices $u$ and $v$ in $G$, respectively.
Li Jianxi, Yang Liu, Wai Shiu
doaj +1 more source