Mutual-visibility number equals 20 in the Hoffman-Singleton graph; algebraic conditions and exact values are given for small-defect (d,2)-graphs.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
math.CO 3years
2025 3verdicts
UNVERDICTED 3representative citing papers
Introduces the visibility polynomial based on mutual-visibility sets and derives explicit forms or properties for cycles, joins, and standard graph families.
Derives closed-form visibility polynomials for several graph classes by characterizing their mutual-visibility sets.
citing papers explorer
-
Mutual visibility in Moore graphs and $(d,2)$-graphs with defect
Mutual-visibility number equals 20 in the Hoffman-Singleton graph; algebraic conditions and exact values are given for small-defect (d,2)-graphs.
-
On the Visibility Polynomial of Graphs
Introduces the visibility polynomial based on mutual-visibility sets and derives explicit forms or properties for cycles, joins, and standard graph families.
-
Visibility Polynomial of Some Graph Classes
Derives closed-form visibility polynomials for several graph classes by characterizing their mutual-visibility sets.