Symmetry breaking in planar and maximal outerplanar graphs
Alikhani, Saeid · Soltani, Samaneh
Original · EN
The distinguishing number (index) D(G) (D'(G)) of a graph G is the least integer d such that G has a vertex (edge) labeling with d labels that is preserved only by a trivial automorphism. In this paper we consider the maximal outerplanar graphs (MOP graphs) and show that MOP graphs, except K₃, can be distinguished by at most two vertex (edge) labels. We also compute the distinguishing number and the distinguishing index of Halin and Mycielskian graphs.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.