The edge reconstruction number of a disconnected graph

DOI10.1002/JGT.3190190310zbMath0824.05047OpenAlexW1994454756MaRDI QIDQ4698087

Robert R. Molina

Publication date: 9 November 1995

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

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

zbMATH Keywords

isomorphismdisconnected graphedge reconstruction numbernonisomorphic components

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Degree associated edge reconstruction number of graphs ⋮ Unnamed Item ⋮ Degree associated edge reconstruction number of split graphs with biregular independent set is one

This page was built for publication: The edge reconstruction number of a disconnected graph