Abstract
AbstractA graph is said to be ‐distinguishable if there is a labeling of the vertices with labels so that only the trivial automorphism preserves the labels. The smallest such is the distinguishing number, . A set of vertices is a determining set for if every automorphism of is uniquely determined by its action on . The size of a smallest determining set for is called the determining number, . The orthogonality graph has vertices which are bitstrings of length with an edge between two vertices if they differ in precisely bits. This paper shows that and that, if when is odd or when is even, then .
Submitted Version (Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.