Domination of Cyclic Monotone (s, t)-Graphs
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
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).
Description
Keywords
domination of graphs, cyclic monotone graphs, stochastic graphs, reliability