AbstractLet d1, d2, …,dn be the degree sequence of a simple graph and suppose p is a positive integer. We show that (∑ni=1d1/pi)p ⩾ ∑ni=1 dpi. Related ‘real’ inequalities, i.e., not graphdependent, are analyzed
AbstractIt was proved by Chartrand that if G is a graph of order p for which the minimum degree is a...
AbstractNecessary and sufficient conditions for the existence of simple graphs with degrees from pre...
Graph TheoryLet (a1,a2,\textellipsis,an) and (b1,b2,\textellipsis,bn) be two sequences of nonnegativ...
AbstractErdös and Gallai characterize in [3] the sequences of integers which are degree sequences of...
AbstractIn [A. Tripathi, S. Vijay, A note on a theorem of Erdös & Gallai, Discrete Math. 265 (2003) ...
AbstractLet G be a graph on X, and let f(x), g(x) be positive integers; several authors have given c...
The main theorem gives a class of inequalities concerning finite hypergraphs with a fixed number of ...
The Erdős–Gallai criteria for recognizing degree sequences of simple graphs involve a system of ineq...
AbstractA nonnegative integer sequence (d1,d2,…,dn) is called a degree sequence if there exists a si...
AbstractAs shown in [D. Hoffman, H. Jordon, Signed graph factors and degree sequences, J. Graph Theo...
AbstractThe paper sets out to investigate the degree sequences d1⩾d2⩾…⩾dn of random graphs of order ...
AbstractWe prove the following results: (i) Let p⩾1 be a real number and let n⩾2 be an integer. If (...
summary:The minimum orders of degree-continuous graphs with prescribed degree sets were investigated...
AbstractWei discovered that the stability number, α(G), of a graph, G, with degree sequence d1, d2,…...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2007.This electronic v...
AbstractIt was proved by Chartrand that if G is a graph of order p for which the minimum degree is a...
AbstractNecessary and sufficient conditions for the existence of simple graphs with degrees from pre...
Graph TheoryLet (a1,a2,\textellipsis,an) and (b1,b2,\textellipsis,bn) be two sequences of nonnegativ...
AbstractErdös and Gallai characterize in [3] the sequences of integers which are degree sequences of...
AbstractIn [A. Tripathi, S. Vijay, A note on a theorem of Erdös & Gallai, Discrete Math. 265 (2003) ...
AbstractLet G be a graph on X, and let f(x), g(x) be positive integers; several authors have given c...
The main theorem gives a class of inequalities concerning finite hypergraphs with a fixed number of ...
The Erdős–Gallai criteria for recognizing degree sequences of simple graphs involve a system of ineq...
AbstractA nonnegative integer sequence (d1,d2,…,dn) is called a degree sequence if there exists a si...
AbstractAs shown in [D. Hoffman, H. Jordon, Signed graph factors and degree sequences, J. Graph Theo...
AbstractThe paper sets out to investigate the degree sequences d1⩾d2⩾…⩾dn of random graphs of order ...
AbstractWe prove the following results: (i) Let p⩾1 be a real number and let n⩾2 be an integer. If (...
summary:The minimum orders of degree-continuous graphs with prescribed degree sets were investigated...
AbstractWei discovered that the stability number, α(G), of a graph, G, with degree sequence d1, d2,…...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2007.This electronic v...
AbstractIt was proved by Chartrand that if G is a graph of order p for which the minimum degree is a...
AbstractNecessary and sufficient conditions for the existence of simple graphs with degrees from pre...
Graph TheoryLet (a1,a2,\textellipsis,an) and (b1,b2,\textellipsis,bn) be two sequences of nonnegativ...
DOI
Add to ORKG