Methods of destroying the symmetries of a graph

zbMath1020.05033MaRDI QIDQ1872551

Frank Harary

Publication date: 6 July 2003

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/50283

zbMATH Keywords

automorphism

Mathematics Subject Classification ID

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

Related Items (32)

Automorphism group and fixing number of \((3,6)\)- and \((4,6)\)-fullerene graphs ⋮ Edge (m,k)-choosability of graphs ⋮ On δ(k)-coloring of generalized Petersen graphs ⋮ Destroying automorphisms by fixing nodes ⋮ ODD-EVEN SUM LABELING OF SOME DISCONNECTED GRAPHS ⋮ On the automorphic chromatic index of a graph ⋮ On \(J\)-colorability of certain derived graph classes ⋮ On some \(L(2, 1)\)-coloring parameters of certain graph classes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Cyclic property of iterative eccentrication of a graph ⋮ On chromatic Zagreb indices of certain graphs ⋮ Switched signed graphs of integer additive set-valued signed graphs ⋮ On certain parameters of equitable coloring of graphs ⋮ Planarity and fixing number of inclusion graph of a nilpotent group ⋮ On the fixing number of functigraphs ⋮ Graceful centers of graceful graphs and universal graceful graphs ⋮ Rainbow neighbourhood number of graphs ⋮ Invariance, quasi-invariance, and unimodularity for random graphs ⋮ Extremal problems on detectable colorings of trees ⋮ A note on δ^(k)-colouring of the Cartesian product of some graphs ⋮ Some properties of alternating group networks ⋮ Graphs of order \(n\) with determining number \(n-3\) ⋮ Injective coloring of complementary prism and generalized complementary prism graphs ⋮ The sparing number of certain graph powers ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On Harmonious Colouring of and ⋮ The Achromatic Colouring Of Graphs ⋮ Unnamed Item ⋮ On the distinguishing number of functigraphs ⋮ Chromatic Zagreb and irregularity polynomials of graphs

This page was built for publication: Methods of destroying the symmetries of a graph