On the basis number of the corona of graphs
The basis number b(G) of a graph G is defined to be the least integer k such that G has a k-fold basis for its cycle space. In this note, we determine the basis number of the corona of graphs, in fact we prove that b(v∘T)=2 for any tree and any vertex v not in T, b(v∘H)≤b(H)+2, where H is any graph...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2006-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/IJMMS/2006/53712 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|