How can you determine the narrowest graphing without graphing