Constructing graphs with several pseudosimilar vertices or edges

DOI10.1016/S0012-365X(02)00615-5zbMath1025.05032MaRDI QIDQ1394823

Josef Lauri

Publication date: 25 June 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

automorphism

Mathematics Subject Classification ID

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

Related Items (7)

\(G\)-graphs: a new representation of groups ⋮ Indistinguishable trees and graphs ⋮ G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs ⋮ A New Property of Hamming Graphs and Mesh of d-ary Trees ⋮ Inverse monoids of partial graph automorphisms ⋮ A note on vertex-transitive non-Cayley graphs from Cayley graphs generated by involutions ⋮ Symmetry and connectivity in G-graphs

This page was built for publication: Constructing graphs with several pseudosimilar vertices or edges