Methods of destroying the symmetries of a graph

MaRDI QIDQ1872551zbMATH OpenFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 2016066
• Symmetry breaking in graphs
• Graph decompositions and symmetry
• scientific article; zbMATH DE number 3985261
• Destroying symmetry by orienting edges: Complete graphs and complete bigraphs
• Breaking graph symmetries by edge colourings
• Detecting almost symmetries of graphs
• Symmetry properties of generalized graph truncations
• scientific article; zbMATH DE number 917616

Cited in

(36)

• Invariant systems of representatives, or the cost of symmetry
• 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
• Automorphism group and fixing number of (3,6)- and (4,6)-fullerene graphs
• On harmonious colouring of \(C(W_n)\) and \(C(F_{m,n})\)
• 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
• scientific article; zbMATH DE number 1109361 (Why is no real title available?)
• Injective coloring of complementary prism and generalized complementary prism graphs
• 3-divisor cordiality of some product related graphs
• scientific article; zbMATH DE number 7336002 (Why is no real title available?)
• On the fixing number of functigraphs
• Chromatic Zagreb and irregularity polynomials of graphs
• Invariance, quasi-invariance, and unimodularity for random graphs
• Edge (m,k)-choosability of graphs
• On \(\delta^{(k)}\)-coloring of generalized Petersen graphs
• ODD-EVEN SUM LABELING OF SOME DISCONNECTED GRAPHS
• Modified chromatic Schultz polynomial of some cycle related graphs
• Planarity and fixing number of inclusion graph of a nilpotent group
• On some parameters related to fixing sets in graphs
• Equivalencies of cordial labeling and sum divisor cordial labeling
• Switched signed graphs of integer additive set-valued signed graphs
• On certain parameters of equitable coloring of graphs
• On the automorphic chromatic index of a graph
• Cyclic property of iterative eccentrication of a graph
• A note on δ^(k)-colouring of the Cartesian product of some graphs
• On automorphisms and fixing number of co-normal product of graphs
• Paint cost spectrum of perfect k-ary trees
• Destroying automorphisms by fixing nodes
• Extremal problems on detectable colorings of trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1872551)