z-logo
open-access-imgOpen Access
An upper bound on the domination number of a graph.
Author(s) -
Dănuţ Marcu
Publication year - 1986
Publication title -
mathematica scandinavica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.553
H-Index - 30
eISSN - 1903-1807
pISSN - 0025-5521
DOI - 10.7146/math.scand.a-12152
Subject(s) - mathematics , domination analysis , combinatorics , graph , upper and lower bounds , mathematical analysis , vertex (graph theory)

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom