Work

All Graphs of Order n with Distinguishing Number n−1 or n − 2

Year: 2025

Type: article

Abstract: 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.

Source: Theory and Applications of Graphs

DOI: 10.20429/tag.2025.120103

Authors: Institut Teknologi Bandung, Indonesia, Andi Pujo Rahadi, Edy Tri Baskoro, Institut Teknologi Bandung, Indonesia, Suhadi Wido Saputro, Institut Teknologi Bandung, Indonesia

Institution: Bandung Institute of Technology

Language: English

Topic: Graph Labeling and Dimension Problems

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W4410812178

FWCI:

Cites: 1

Cited by:

Related to: 10