✦ LIBER ✦

Bounding the Derived Length for a Given Set of Character Degrees

✍ Scribed by Kamal Aziziheris

Publisher: Springer Netherlands
Year: 2010
Tongue: English
Weight: 266 KB
Volume: 14
Category: Article
ISSN: 1386-923X
DOI: 10.1007/s10468-010-9224-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Set of Cycle Lengths in a Hamilto

On the Set of Cycle Lengths in a Hamiltonian Graph with a Given Maximum Degree

✍ Antoni Marczyk 📂 Article 📅 2004 🏛 Springer Japan 🌐 English ⚖ 278 KB

Thep-Length of a Solvable Group Bounded

Thep-Length of a Solvable Group Bounded by Conditions on its Character Degree Graph

✍ Judith Pense 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 217 KB

Bounding the structure constants of a gr

Bounding the structure constants of a group in terms of its number of irreducible character degrees

✍ Sidney C Garrison 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 409 KB

An elementary method for the calculation

An elementary method for the calculation of the set of character degrees of somep-groups

✍ Alexander Moretó 📂 Article 📅 2001 🏛 Springer Milan 🌐 Italian ⚖ 211 KB

A sharp upper bound for the number of st

A sharp upper bound for the number of stable sets in graphs with given number of cut edges

✍ Hongbo Hua 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 648 KB

Let G be a connected and simple graph, and let i(G) denote the number of stable sets in G. In this letter, we have presented a sharp upper bound for the i(G)-value among the set of graphs with k cut edges for all possible values of k, and characterized the corresponding extremal graphs as well.

A lower bound for the length of addition

A lower bound for the length of addition chains

✍ Arnold Schönhage 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 516 KB