We consider the number of vertex independent sets i(G). In general, the problem of determining the value of i(G) is NP-complete. We present several upper and lower bounds for i(G) in terms of order, ...
The metric dimension is a key invariant in graph theory that encapsulates the minimal number of reference points, or “resolving sets”, required to uniquely determine the position of each vertex within ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback