is there any sagemath code to find a dominating set D with the property that distance between any two vertices in D is atleast 3?

asked 2023-04-27 05:22:02 +0100

Is there any sagemath code to find a dominating set D with the property that distance between any two vertices in D is atleast 3?

edit retag flag offensive close merge delete

Comments

1

Your problem is not well defined. From the definition of a dominating set, a vertex in D is at distance at most two from another vertex in D. The condition that vertices in D must be at distance at least 3 from each other can therefore not be satisfied.

David Coudert gravatar imageDavid Coudert ( 2023-04-27 09:08:26 +0100 )edit