Distinguishing orthogonality graphs

DOI10.1002/jgt.22704zbMath1522.05400arXiv2001.00092OpenAlexW3175902806MaRDI QIDQ6056750

Sally Cockburn, Debra L. Boutin

Publication date: 4 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.00092

zbMATH Keywords

determining setdistinguishing numberorthogonality graph

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distinguishability of infinite groups and graphs
• Cartesian powers of graphs can be distinguished by two labels
• Identifying graph automorphisms using determining sets
• Using determining sets to distinguish Kneser graphs
• Distinguishability of locally finite trees
• Hadamard graphs. I
• Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances
• The distinguishing number of the hypercube
• Symmetry breaking in graphs
• On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture
• Distinguishing infinite graphs
• Distinguishing number and distinguishing index of neighbourhood corona of two graphs
• Coloring an Orthogonality Graph
• The determining number of a Cartesian product
• Automorphism related parameters of a graph associated to a finite vector space
• Distinguishing Cartesian powers of graphs
• Distinguishing Cartesian powers of graphs

This page was built for publication: Distinguishing orthogonality graphs