Open AccessA note on kernels and solutions in digraphs
Author(s) -
Matúš Harminc,
Roman Soták
Publication year - 1999
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.1098
Subject(s) - mathematics , combinatorics , digraph , discrete mathematics
For given nonnegative integers k, s an upper bound on the minimum number of vertices of a strongly connected digraph with exactly k kernels and s solutions is presented.
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