Abstract
A subgraph H of a graph G is unique if H is not isomorphic to any other subgraph of G. The existence of a graph on n vertices having at least 2 n 2 2−cn 3 2 unique subgraphs is proven for c > 3 2 √2 and n sufficiently large.
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
