Rainbow connection number of graph power and graph products by R Arunselvan
Material type:![Book](/opac-tmpl/lib/famfamfam/BK.png)
- 511.5028566 P11
Item type | Current library | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|
![]() |
JRD Tata Memorial Library | 511.5028566 P11 (Browse shelf(Opens below)) | Available | T07551 |
Browsing JRD Tata Memorial Library shelves Close shelf browser (Hides shelf browser)
No cover image available | No cover image available |
![]() |
No cover image available | No cover image available |
![]() |
![]() |
||
511.5028551 P03 Approximation algorithms for the K- MST problem | 511.5028551 P16 Some algebraic aspects of graph similarity algorithms | 511.502855369 TRO The mathematica guidebook for graphics / | 511.5028566 P11 Rainbow connection number of graph power and graph products | 511.56 P18 Problems on bend-number, circular separation dimension, and maximum edge 2-coloring | 511.6 GOD Algebraic graph theory | 511.6 GOD Algebraic graph theory |
Includes CD and bibliography.
MSc(Eng);2011;Computer Science and Automation.
There are no comments on this title.