Bounds of Eigenvalues of K3,3-Minor Free Graphs
The spectral radius ρ(G) of a graph G is the largest eigenvalue of its adjacency matrix. Let λ(G) be the smallest eigenvalue of G. In this paper, we have described the K3,3-minor free graphs and showed that (A) let G be a simple graph with order n≥7. If G has no K3,3...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2009-01-01
|
| Series: | Journal of Inequalities and Applications |
| Online Access: | http://dx.doi.org/10.1155/2009/852406 |