𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An upper bound for the largest eigenvalue of a graph: Effect of types of vertices

✍ Scribed by Lemi Türker

Publisher
Springer
Year
1992
Tongue
English
Weight
423 KB
Volume
9
Category
Article
ISSN
0259-9791

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A sharp upper bound on the largest Lapla
A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs
✍ Kinkar Ch. Das; R.B. Bapat 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 217 KB

We consider weighted graphs, where the edge weights are positive definite matrices. The Laplacian of the graph is defined in the usual way. We obtain an upper bound on the largest eigenvalue of the Laplacian and characterize graphs for which the bound is attained. The classical bound of Anderson and

An upper bound on the size of a largest
An upper bound on the size of a largest clique in a graph
✍ Dennis P. Geoffroy; David P. Sumner 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 308 KB 👁 1 views

## Abstract A graph is point determining if distinct vertices have distinct neighborhoods. The nucleus of a point‐determining graph is the set __G__^O^ of all vertices, __v__, such that __G__–__v__ is point determining. In this paper we show that the size, ω(__G__), of a maximum clique in __G__ sat