Skip to main content

Research Repository

Advanced Search

All Outputs (4)

The binding number of almost every graph (1991)
Presentation / Conference
Zverovich, V. (1991, June). The binding number of almost every graph. Presented at The 14th Conference on Discrete Mathematics of the South Science Centre of the AN USSR, Odessa, Ukraine

A characterization of domination perfect graphs (1991)
Journal Article
Zverovich, V. E., Zverovich, I. E., Zverovich, I., & Zverovich, V. (1991). A characterization of domination perfect graphs. Journal of Graph Theory, 15(2), 109-114. https://doi.org/10.1002/jgt.3190150202

Let γ(G) and i(G) be the domination number and independent domination number of a graph G, respectively. Sumner and Moore [8] define a graph G to be domination perfect if γ(H) = i(H), for every induced subgraph H of G. In this article, we give a fini... Read More about A characterization of domination perfect graphs.