Methods of destroying the symmetries of a graph

From MaRDI portal
Publication:1872551


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


05C35: Extremal problems in graph theory

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

05C15: Coloring of graphs and hypergraphs

05C78: Graph labelling (graceful graphs, bandwidth, etc.)


Related Items

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