✦ LIBER ✦

Note on finding the strength of a column of irregular shape

✍ Scribed by Thomas M. Cleemann

Publisher: Elsevier Science
Year: 1876
Tongue: English
Weight: 104 KB
Volume: 101
Category: Article
ISSN: 0016-0032
DOI: 10.1016/0016-0032(76)90279-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the irregularity strength of trees

✍ Tom Bohman; David Kravitz 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB

## Abstract For any graph __G__, let __n~i~__ be the number of vertices of degree __i__, and $\lambda (G)={max} \_{i\le j}\{ {n\_i+\cdots +n\_j+i-1\over j}\}$. This is a general lower bound on the irregularity strength of graph __G__. All known facts suggest that for connected graphs, this is the a

A note on the index of irregularity

✍ Ladislav Skula 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 528 KB

A note on the irregularity of graphs

✍ F.K. Bell 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 517 KB

A supplementary note on the irregulariti

A supplementary note on the irregularities of distributions

✍ M. Warmus 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 127 KB

A note on the complexity of finding regu

A note on the complexity of finding regular subgraphs

✍ J. Plesník 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 308 KB

On the irregularity strength of the m ×

On the irregularity strength of the m × n grid

✍ Jeffrey H. Dinitz; David K. Garnick; Andras Gyárfás 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 939 KB

## Abstract Given a graph __G__ with weighting __w__: __E__(__G__) ← __Z__^+^, the __Strength__ of __G__(__w__) is the maximum weight on any edge. The __sum__ of a vertex in __G__(__w__) is the sum of the weights of all its incident edges. The network __G__(__w__) is __irregular__ if the vertex sum