Domination of Cyclic Monotone (s, t)-Graphs
| dc.contributor.author | Черняк, Аркадий Александрович | |
| dc.date.accessioned | 2016-10-24T10:25:41Z | |
| dc.date.available | 2016-10-24T10:25:41Z | |
| dc.date.issued | 2000 | |
| dc.description.abstract | The conjecture of zero domination of 0-cyclic monotone graphs is proved (an r-cyclic graph is a cyclic monotone (s, t)-graph exactly r minimal parts of which have cycles). | ru_RU |
| dc.identifier.uri | http://elib.bspu.by/handle/doc/15979 | |
| dc.language.iso | en | ru_RU |
| dc.relation.ispartofseries | Mathematical Notes;Vol 67, №2- С. 233-238 | |
| dc.subject | domination of graphs | ru_RU |
| dc.subject | cyclic monotone graphs | ru_RU |
| dc.subject | stochastic graphs | ru_RU |
| dc.subject | reliability | ru_RU |
| dc.title | Domination of Cyclic Monotone (s, t)-Graphs | ru_RU |
| dc.type | Article | ru_RU |