✦ LIBER ✦

The degree of a Σn cut

✍ Scribed by C.T. Chong; K.J. Mourad

Book ID: 103601654
Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 602 KB
Volume: 48
Category: Article
ISSN: 0168-0072
DOI: 10.1016/0168-0072(90)90021-s

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Σn+1-invariant forms of higher degree

✍ Andrzej Sładek 📂 Article 📅 2009 🏛 SP Versita 🌐 English ⚖ 349 KB

The Distribution of Properly Σ02e-Degree

The Distribution of Properly Σ02e-Degrees

✍ Stanislaw Bereznyuk, Richard Coles and Andrea Sorbi 📂 Article 📅 2000 🏛 Association for Symbolic Logic 🌐 English ⚖ 317 KB

Concerning the existence of a Σ−n compou

Concerning the existence of a Σ−n compound

✍ E. Gandolfi; J. Heughebaert; E. Quercigh 📂 Article 📅 1959 🏛 Società Italiana di Fisica ⚖ 213 KB

Measurement of the Σ−→ne−¯vand Σ−→ nμ−¯v

Measurement of the Σ−→ne−¯vand Σ−→ nμ−¯vrates

✍ G. Ang; F. Eisele; R. Engelmann; H. Filthuth; W. Föhlisch; V. Hepp; E. Leitner; 📂 Article 📅 1969 🏛 Springer 🌐 English ⚖ 871 KB

On graphs having σ-polynomials of the sa

On graphs having σ-polynomials of the same degree

✍ Nian-Zu Li 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 598 KB

The number of cut-vertices in a graph of

The number of cut-vertices in a graph of given minimum degree

✍ Michael O. Albertson; David M. Berman 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Albertson, M.O. and D.M. Berman, The number of cut-vertices in a graph of given minimum degree, Discrete Mathematics 89 (1991) 97-100. A graph with n vertices and minimum degree k 2 2 can contain no more than (2k -2)n/(kz -2) cut-vertices. This bound is asymptotically tight. \* Research supported in