✦ LIBER ✦

Identifying certain types of parts of a graph and computing their number

✍ Scribed by N. P. Khomenko; L. D. Golovko

Book ID: 112478504
Publisher: Springer
Year: 1973
Tongue: English
Weight: 638 KB
Volume: 24
Category: Article
ISSN: 0041-5995
DOI: 10.1007/bf01086243

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computation of minimal rank and path cov

Computation of minimal rank and path cover number for certain graphs

✍ Francesco Barioli; Shaun Fallat; Leslie Hogben 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 290 KB

A certain polynomial of a graph and grap

A certain polynomial of a graph and graphs with an extremal number of trees

✍ A.K Kelmans; V.M Chelnokov 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 760 KB

Computing the Stability Number of a Grap

Computing the Stability Number of a Graph Via Linear and Semidefinite Programming

✍ Peña, Javier; Vera, Juan; Zuluaga, Luis F. 📂 Article 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 246 KB

The Endomorphism Type of Certain Biparti

The Endomorphism Type of Certain Bipartite Graphs and a Characterization of Projective Planes

✍ Ralf Köhl, Katja Möser, Hendrik Van Maldeghem 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 111 KB

Independence numbers of locally sparse g

Independence numbers of locally sparse graphs and a Ramsey type problem

✍ Noga Alon 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 409 KB 👁 1 views

Let G = (V, E ) be a graph on n vertices with average degree t 2 1 in which for every vertex u E V the induced subgraph on the set of all neighbors of u is r-colorable. We show that the independence number of G is at least log t , for some absolute positive constant c. This strengthens a well-known

Spectral decompositions of certain autom

Spectral decompositions of certain automorphic functions and their number-theoretic applications

✍ V. A. Bykovskii 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 715 KB