Constructing graphs with pairs of pseudo-similar vertices

DOI10.1016/0095-8956(82)90030-2MaRDI QIDQ1154486zbMATH OpenOpenAlexFDO

Authors Chris Godsil, William 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)

Cites work

• scientific article; zbMATH DE number 3710223 (Why is no real title available?)
• scientific article; zbMATH DE number 3526703 (Why is no real title available?)
• scientific article; zbMATH DE number 3639660 (Why is no real title available?)
• scientific article; zbMATH DE number 3227795 (Why is no real title available?)
• Cospectral graphs and digraphs with given automorphism group
• Pseudosimilar vertices in a graph

Cited in

(9)

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

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

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