Dr Vadim Zverovich's Outputs (92)

The binding number of a random graph (1997)
Journal Article

Line hypergraphs (1996)
Journal Article

In this paper, we introduce a new multivalued function ℒ called the line hypergraph. The function ℒ generalizes two classical concepts at once, namely, of the line graph and the dual hypergraph. In terms of this function, proofs of some known theorem... Read More about Line hypergraphs.

Domination perfect and upper domination perfect graphs (1996)
Presentation / Conference Contribution

Domination perfect graphs (1995)
Presentation / Conference Contribution

An induced subgraph characterization of domination perfect graphs (1995)
Journal Article

Let γ(G) ι(G) be the domination number and independent domination number of a graph (G), respectively. A graph (G) is called domination perfect if γ(H) = ι(H), for every induced subgraph H of (G). There are many results giving a partial characterizat... Read More about An induced subgraph characterization of domination perfect graphs.

Disproof of a Conjecture in the Domination Theory (1994)
Journal Article

In [1] C. Barefoot, F. Harary and K. Jones conjectured that for cubic graphs with connectivity three the difference between the domination and independent domination numbers is at most one. We disprove this conjecture and give an exhaustive answer to... Read More about Disproof of a Conjecture in the Domination Theory.

Extended abstract of PhD thesis: Graph-theoretic invariants connected with neighbourhoods of vertex sets (1993)
Other

A proof of Woodall's conjecture on the binding number (1993)
Report

A catalogue of connected 4-regular locally connected graphs (1993)
Journal Article

Contributions to the theory of graphic sequences (1992)
Journal Article

In this article we present a new version of the Erdős-Gallai theorem concerning graphicness of the degree sequences. The best conditions of all known on the reduction of the number of Erdős-Gallai inequalities are given. Moreover, we... Read More about Contributions to the theory of graphic sequences.

Perfect graphs in domination theory (1992)
Presentation / Conference Contribution

Graph-theoretic invariants connected with neighbourhoods of vertex sets (1992)
Thesis

The binding number for random graphs (1992)
Report

The binding number of almost every graph (1991)
Presentation / Conference Contribution

A characterization of domination perfect graphs (1991)
Journal Article

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.

A note on domatically critical and cocritical graphs (1991)
Journal Article

A characterization of perfect dominating-clique graphs (1991)
Journal Article

Solving industrial problems connected with analysis of chemical compounds (1990)
Presentation / Conference Contribution

Domination and independence in graphs (1990)
Presentation / Conference Contribution

Estimations of the binding number of graphs with a large girth (1990)
Report