Open AccessRandom procedures for dominating sets in bipartite graphs
Author(s) -
Sarah Artmann,
Jochen Harant
Publication year - 2010
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1494
Subject(s) - mathematics , bipartite graph , combinatorics , multilinear map , complete bipartite graph , discrete mathematics , graph , pure mathematics
Using multilinear functions and random procedures, new upper bounds on the domination number of a bipartite graph in terms of the cardinalities and the minimum degrees of the two colour classes are established.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom