All Graphs of Order n with Distinguishing Number n−1 or n − 2
Let G be a simple connected graph. The distinguishing number of G, denoted by D(G), is the least integer d such that G has a vertex d-labeling preserved only by the trivial automorphism. In this paper, we characterize all graphs of order n with distinguishing number n − 1, or n − 2.
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Georgia Southern University
2025-05-01
|
| Series: | Theory and Applications of Graphs |
| Subjects: | |
| Online Access: | https://digitalcommons.georgiasouthern.edu/tag/vol12/iss1/3/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|