|
|||||
 |
|
|
|
|
|
|
|
Inverse
domination: stability, unique minimum dominating sets, and
dual domination
Timothy Edwards and David Prier |
|
Vol. 18 (2025), No. 5, 885–896
|
Abstract |
|
An open question in graph theory asks whether the inverse domination number of an isolate-free graph is always less than or equal to the independence number of said graph. We discuss several classes of graphs for which this conjecture has already been proved and state general upper bounds on the inverse domination number. We also provide examples to demonstrate the complexity of this problem. This problem appears to be easier to address for graphs with a unique minimum dominating set or with maximum dual domination number. We end with two sections discussing these properties and their relation to this problem. |
PDF Access Denied
We have not been able to recognize your IP address
18.97.14.86
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our journal-recommendation form. Or, visit our subscription page for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for USD 30.00:
Keywords
graph theory, domination, inverse domination, stability,
dual domination
|
Mathematical Subject Classification
Primary: 05C69
|
Milestones
Received: 11 March 2024
Accepted: 13 June 2024
Published: 20 November 2025
Communicated by John C. Wierman
|
Authors |
| Timothy Edwards | |
| Department of Mathematics Gannon University Erie, PA United States |
|
| David Prier | |
| Department of Mathematics Gannon University Erie, PA United States |
|
| © 2025 MSP (Mathematical Sciences Publishers). |
