Small label classes in 2-distinguishing labelings

DOI10.26493/1855-3974.31.D93zbMath1162.05017OpenAlexW1538373352WikidataQ129352247 ScholiaQ129352247MaRDI QIDQ5502846

Debra L. Boutin

Publication date: 9 January 2009

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.31.d93

zbMATH Keywords

graphautomorphism groupdistinguishing labeling

Mathematics Subject Classification ID

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

Related Items (10)

THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH ⋮ Finite and infinite vertex-transitive cubic graphs and their distinguishing cost and density ⋮ Paint cost and the frugal distinguishing number ⋮ Symmetry parameters of various hypercube families ⋮ Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed ⋮ On a theorem of Halin ⋮ Infinite graphs with finite 2-distinguishing cost ⋮ The cost of 2-distinguishing hypercubes ⋮ The determining number of a Cartesian product ⋮ Symmetry parameters for Mycielskian graphs

This page was built for publication: Small label classes in 2-distinguishing labelings