Two vertices of a graph are adjacent if an edge joins them. A graph automorphism preserves this relation in both directions. In an intersection graph, adjacency can be defined by a prescribed dimension or cardinality of an intersection, so any ambient symmetry preserving that statistic acts by graph automorphisms.
Articles by others on the same topic
There are currently no matching articles.