Constructing graphs with pairs of pseudo-similar vertices

DOI10.1016/0095-8956(82)90030-2zbMath0465.05059OpenAlexW1968327293MaRDI QIDQ1154486

Chris D. Godsil, William L. Kocay

Publication date: 1982

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(82)90030-2

zbMATH Keywords

graph automorphismpseudo-similar edgespseudo-similar vertices

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (9)

A note on non-reconstructible 3-hypergraphs ⋮ Enumeration of Seidel matrices ⋮ Communicability cosine distance: similarity and symmetry in graphs/networks ⋮ Ordered sets that are reconstructible from two cards and the number of comparabilities. ⋮ Critically twin primitive 2-structures ⋮ Pseudo-similar points in ordered sets ⋮ Inverse monoids of partial graph automorphisms ⋮ Graphs with three mutually pseudo-similar vertices ⋮ On pseudosimilarity in trees

Cites Work

• Cospectral graphs and digraphs with given automorphism group
• Pseudosimilar vertices in a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Constructing graphs with pairs of pseudo-similar vertices