THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH

DOI10.22044/jas.2020.8343.1408zbMath1468.05253arXiv1710.07527OpenAlexW3139055471MaRDI QIDQ4956581

Samaneh Soltani, Saeid Alikhani

Publication date: 2 September 2021

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

zbMATH Keywords

determining setdistinguishing numberdistinguishing labeling

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

Paint cost and the frugal distinguishing number

Cites Work

• Unnamed Item
• Distinguishing Cartesian products of countable graphs
• The list distinguishing number equals the distinguishing number for interval graphs
• Bounding the distinguishing number of infinite graphs and permutation groups
• Identifying graph automorphisms using determining sets
• Using determining sets to distinguish Kneser graphs
• Symmetry breaking in graphs
• Distinguishing graphs with intermediate growth
• The distinguishing number of the augmented cube and hypercube powers
• Distinguishing number and distinguishing index of natural and fractional powers of graphs
• THE DISTINGUISHING NUMBERS OF MERGED JOHNSON GRAPHS
• Small label classes in 2-distinguishing labelings

This page was built for publication: THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH