148 search results - page 1 / 30 » Sums of powers of the degrees of a graph |
DM
2006
13 years 5 months ago
2006
For a graph G and k a real number, we consider the sum of the k-th powers of the degrees of the vertices of G. We present some general bounds on this sum for various values of k. ...
ALGORITHMICA
2004
13 years 5 months ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
GC
2010
Springer
13 years 2 months ago
2010
Springer
A graph of order n is said to be pancyclic if it contains cycles of all lengths from three to n. Let G be a hamiltonian graph and let x and y be vertices of G that are consecutive ...
COMBINATORICS
2004
13 years 5 months ago
2004
We give a basis for the space spanned by the sum ^s of the lowest degree terms in the expansion of the Schur symmetric functions s in terms of the power sum
DM
2008
13 years 5 months ago
2008
A weighted graph is one in which every edge e is assigned a nonnegative number w(e), called the weight of e. The weight of a cycle is defined as the sum of the weights of its edge...