Near automorphisms of complement or square of a path

DOI10.1007/S10878-023-01013-WMaRDI QIDQ2698005zbMATH OpenOpenAlexFDO

Authors Dein Wong, Jiahui Yin, Jiao Wang

Publication date 14 April 2023

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-023-01013-w

zbMATH Keywords

automorphismsquare graphcomplement of a graphnear automorphism

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Mathematical programming (90Cxx)

Recommendations

• Near automorphisms of cycles
• Near-automorphisms of paths
• Near automorphisms of trees with small total relative displacements
• Total relative displacement of vertex permutations of K
• Graphs self-complementary in \(K_ n-e\)

Cites work

• A study of total relative displacements of permutations in paths and cycles
• Near automorphisms of cycles
• Near automorphisms of trees with small total relative displacements
• Near-automorphisms of paths
• Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs.
• Total relative displacement of permutations
• Total relative displacement of vertex permutations of K

Cited in

(1)

• Near automorphisms of cycles

This page was built for publication: Near automorphisms of complement or square of a path

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