Let 
be the number of vertices in a graph 
and 
the length of the maximum cycle in 
. Then the shortness exponent of a class of graphs 
is defined by
 |
Shortness Exponent
Explore with Wolfram|Alpha
References
Grünbaum, B. and Walther, H. "Shortness Exponents of Families of Graphs." J. Combin. Th. A 14, 364-385, 1973.Owens, P. J. "Bipartite Cubic Graphs and a Shortness Exponent." Disc. Math. 44, 327-330, 1983.Referenced on Wolfram|Alpha
Shortness ExponentCite this as:
Weisstein, Eric W. "Shortness Exponent." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/ShortnessExponent.html