𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the ordering of graphs with respect to their matching numbers

✍ Scribed by Ivan Gutman; Fuji Zhang

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
350 KB
Volume
15
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On graphs critical with respect to verte
On graphs critical with respect to vertex partition numbers
✍ Peter MihΓ³k πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 362 KB

For k 3 0, pk(G) den ot e s the Lick-White vertex partition number of G. A graph G is called (n, k)-critical 'f 't I I is connected and for each edge e of G Pk (G -e) < pk (G) = n. We describe all (2, k&critical graphs and for n 23, k 2 1 we extend and simplify a result of Bollobas and Harary giving

On ordering bicyclic graphs with respect
On ordering bicyclic graphs with respect to the Laplacian spectral radius
✍ Shuchao Li; Slobodan K. SimiΔ‡; Dejan V. ToΕ‘iΔ‡; Qin Zhao πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 303 KB

A connected graph of order n is bicyclic if it has n + 1 edges. He et al. [C.X. He, J.Y. Shao, J.L. He, On the Laplacian spectral radii of bicyclic graphs, Discrete Math. 308 (2008) 5981-5995] determined, among the n-vertex bicyclic graphs, the first four largest Laplacian spectral radii together wi