|
|||||
 |
|
|
|
|
|
|
|
Edge-determining
sets and determining index
Sally Cockburn and Sean McAvoy |
|
Vol. 17 (2024), No. 1, 85–106
|
Abstract |
|
A graph automorphism is a bijective mapping of the vertices that preserves adjacent vertices. A vertex-determining set of a graph is a set of vertices such that the only automorphism that fixes those vertices is the identity. The size of a smallest such set is called the determining number, denoted by . The determining number is a parameter of the graph capturing its level of symmetry. We introduce the related concept of an edge-determining set and determining index, . We prove that when and show both bounds are sharp for infinite families of graphs. Further, we investigate properties of these new concepts, as well as provide the determining index for several families of graphs, including hypercubes. |
PDF Access Denied
We have not been able to recognize your IP address
18.222.83.185
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our journal-recommendation form. Or, visit our subscription page for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for USD 30.00:
Keywords
determining number, distinguishing index, hypercubes
|
Mathematical Subject Classification
Primary: 05C25
Secondary: 05C70
|
Milestones
Received: 29 July 2022
Revised: 30 December 2022
Accepted: 30 December 2022
Published: 15 March 2024
Communicated by Anant Godbole
|
Authors |
| Sally Cockburn | |
| Mathematics and Statistics
Department Hamilton College Clinton, NY United States |
|
| Sean McAvoy | |
| Department of Statistics University of California Berkeley, CA United States |
|
| © 2024 MSP (Mathematical Sciences Publishers). |
