Total relative displacement of vertex permutations of K

DOI10.1002/JGT.10078zbMath1020.05034OpenAlexW2401792876MaRDI QIDQ4798105

K. Brooks Reid

Publication date: 19 March 2003

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10078

zbMATH Keywords

combinatorial optimizationmatricescomplete multipartite graphsnear-automorphismvertex permutations

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Combinatorial optimization (90C27) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (5)

Chaotic numbers of complete bipartite graphs and tripartite graphs ⋮ Near automorphisms of complement or square of a path ⋮ Near automorphisms of cycles ⋮ Near automorphisms of trees with small total relative displacements ⋮ Near-automorphisms of paths

This page was built for publication: Total relative displacement of vertex permutations of K