✦ LIBER ✦

Sums of Powers of the Degrees of Graphs withkCut Edges

✍ Scribed by Shuchao Li; Lixia Yan

Publisher: Springer Japan
Year: 2010
Tongue: English
Weight: 298 KB
Volume: 27
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-010-0996-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vertex-Distinguishing Edge Colorings of

Vertex-Distinguishing Edge Colorings of Graphs with Degree Sum Conditions

✍ Bin Liu; Guizhen Liu 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 183 KB

Sequences of degrees of edges of self-co

Sequences of degrees of edges of self-complementary graphs

✍ Zh. A. Chernyak 📂 Article 📅 1983 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 596 KB

Upper bounds on the sum of powers of the

Upper bounds on the sum of powers of the degrees of a simple planar graph

✍ Jochen Harant; Stanislav Jendrol; Tomáš Madaras 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB 👁 1 views

On the Maximum Zagreb Indices of Graphs

On the Maximum Zagreb Indices of Graphs withkCut Vertices

✍ Qin Zhao; Shuchao Li 📂 Article 📅 2009 🏛 Springer Netherlands 🌐 English ⚖ 527 KB

Sum Coloring of Bipartite Graphs with Bo

Sum Coloring of Bipartite Graphs with Bounded Degree

✍ Michal Malafiejski; Krzysztof Giaro; Robert Janczewski; Marek Kubale 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 580 KB

A Degree Sum Condition for the Existence

A Degree Sum Condition for the Existence of a Contractible Edge in a κ-Connected Graph

✍ Matthias Kriesell 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 184 KB

It is known that a noncomplete }-connected graph of minimum degree of at least w 5} 4 x contains a }-contractible edge, i.e., an edge whose contraction yields again a }-connected graph. Here we prove the stronger statement that a noncomplete }-connected graph for which the sum of the degrees of any