Please use this identifier to cite or link to this item:
http://hdl.handle.net/10263/1415Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Rao, Siddani Bhaskara | - |
| dc.date.accessioned | 2011-02-22T09:02:03Z | - |
| dc.date.available | 2011-02-22T09:02:03Z | - |
| dc.date.issued | 1979 | - |
| dc.identifier.citation | Discrete mathematicsV28(3)P291-301 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10263/1415 | - |
| dc.language.iso | en | en_US |
| dc.subject | Open chains | en_US |
| dc.subject | Graphs | en_US |
| dc.title | The number of open chains of length three and the parity of the number of open chains of length k in self-complimentary graphs | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | Mathematics and Statistics | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| DM-28-3-1979-P291-301.pdf | 331 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.