scientific article; zbMATH DE number 1136782

zbMATH Open0891.05055MaRDI QIDQ4383335FDOQ4383335

Authors: K. Apostolidou 

Publication date: 1 April 1998

Full work available at URL: https://eudml.org/doc/237678

Title of this publication is not available (Why is that?)

Recommendations

• Infinite digraphs with nonreconstructible outvalency sequences
• All digraphs are N-reconstructible if all digraphs with 2-connected underlying graphs are N-reconstructible
• On digraph reconstruction
• A property of most of the known non-reconstructible digraphs

zbMATH Keywords

digraphvalencyedge-reconstructible

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cited In (10)

• The \((\leq 6)\)-half-reconstructibility of digraphs
• A conjecture on the reconstruction of graphs from metric balls of their vertices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Digraph isomorphism using subdigraph equivalent vertices and degree pair association.
• Title not available (Why is that?)
• Block line cut vertex digraphs of digraphs
• Neighborhood degrees associated reconstruction of digraphs for Ulam's conjecture
• On digraph reconstruction
• On the edge reconstruction of locally finite disconnected graphs with a finite number of components

This page was built for publication:

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