Constructing graphs with pairs of pseudo-similar vertices

DOI10.1016/0095-8956(82)90030-2zbMATH Open0465.05059OpenAlexW1968327293MaRDI QIDQ1154486FDOQ1154486

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

• Pseudosimilar vertices in a graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Cospectral graphs and digraphs with given automorphism group
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

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

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)