Abstract
It is proved that if two graphs of order n have n−p cards (vertex-deleted subgraphs) in common, where p⩾3, and n is large enough compared with p, then the numbers of edges in the two graphs differ by at most p−2. This is a modest but nontrivial improvement of the easy result that these numbers differ by at most p.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
