TOPICS
Search

Mutual-Visibility Number

The mutual-visibility number of a simple graph G, denoted mu(G), is the cardinality of the largest mutual-visibility set of G (Di Stefano 2022, Tonny and Shikhi 2025). The number of maximum mutual-visibility sets of G is denoted r_mu(G) (Tonny and Shikhi 2025).

This notation is not to be confused with the mu used for the matching polynomial, circuit rank, or a strongly regular graph parameter.

See also

Mutual-Visibility Set, Visibility Polynomial

Explore with Wolfram|Alpha

References

Di Stefano, G. "Mutual Visibility in Graphs." Appl. Math. Comput. 419, 126850, 2022.Tonny, K. B. and Shikhi, M. "On the Visibility Polynomial of Graphs." 2 Jul 2025. https://arxiv.org/abs/2507.01851.

Cite this as:

Weisstein, Eric W. "Mutual-Visibility Number." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Mutual-VisibilityNumber.html

Subject classifications