Pseudosimilar vertices in a graph

DOI10.1002/jgt.3190050207zbMath0426.05040OpenAlexW1966170165MaRDI QIDQ3861438

Robert J. Jun. Kimble, Allen J. Schwenk

Publication date: 1981

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

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

zbMATH Keywords

reconstruction conjecturepseudosimilar verticespseudosimilar edges

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (9)

Large sets of pseudosimilar vertices ⋮ Strong cospectrality in trees ⋮ Constructing graphs with pairs of pseudo-similar vertices ⋮ Unnamed Item ⋮ The walk partition and colorations of a graph ⋮ Indistinguishable trees and graphs ⋮ Inverse monoids of partial graph automorphisms ⋮ Graphs with three mutually pseudo-similar vertices ⋮ On pseudosimilarity in trees

This page was built for publication: Pseudosimilar vertices in a graph