Abstract
This paper presents a new proof of Whitney's theorem on edge-isomorphisms of graphs and extends Whitney's theorem to hypergraphs. Whitney's theorem asserts that any two edge-isomorphic graphs of order at least 5 have their edge-isomorphism induced by a node-isomorphism isomorphism. Previous results of Gardner and of Berge and Rado are used.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
