Abstract
With the help of the AutoGraphiX system, we study relations of the form
where i 1(G) and i 2(G) are invariants of the graph G, ⊕ is one of the operations −,+,/,×, \(\underline{b}_{m}\) and \(\overline{b}_{m}\) are best possible lower and upper bounding functions depending only one the size m of G. Specifically, we consider pairs of indices where i 1(G) is a measure of distance, i.e., diameter, radius or average eccentricity, and i 2(G) is a measure of connectivity, i.e., minimum degree, edge connectivity and vertex connectivity. Conjectures are obtained and then proved in almost all cases.
Similar content being viewed by others
References
Aouchiche, M. (2006). Comparaison Automatisée d’Invariants en Théorie des Graphes (French). Ph.D. thesis, École Polytechnique de Montréal, available at www.gerad.ca/~agx.
Aouchiche, M., Bonnefoy, J. M., Fidahoussen, A., Caporossi, G., Hansen, P., Hiesse, L., Lacheré, J., & Monhait, A. (2006). Variable neighborhood search for extremal graphs 14: the AutoGraphiX 2 system. In L. Liberti & N. Maculan (Eds.), Global optimization: from theory to implementation (pp. 281–310). Berlin: Springer.
Aouchiche, M., Caporossi, G., & Hansen, P. (2006). Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants. Match, 58, 365–384.
Aouchiche, M., Caporossi, G., Hansen, P., & Laffay, M. (2005). AutoGraphiX: a survey. Electronic Notes in Discrete Mathematics, 22, 515–520.
Caporossi, G., & Hansen, P. (2000). Variable neighborhood search for extremal graphs. I. The AutoGraphiX system. Discrete Mathematics, 212, 29–44.
Caporossi, G., & Hansen, P. (2004). Variable neighborhood search for extremal graphs. V. Three ways to automate finding conjectures. Discrete Mathematics, 276, 81–94.
Dankelmann, P., Goddard, W., & Swart, C. S. (2004). The average eccentricity of a graph and its subgraphs. Utilitas Mathematica, 65, 41–51.
Erdös, P., Saks, M., & Sós, V. (1986). Maximum induced trees in graphs. Journal of Graph Theory, 41, 61–79.
Harary, F. (1962). The maximum connectivity of a graph. Proceedings of the National Academy of Sciences of the United States of America, 48, 1142–1146.
Nordhaus, E. A., & Gaddum, J. W. (1956). On complementary graphs. The American Mathematical Monthly, 63, 175–177.
Sedlar, J., Vukičević, D., Aouchiche, M., & Hansen, P. (2008). Variable neighborhood search for extremal graphs. 25. Products of connectivity and distance measures. Graph Theory Notes of New York, LV, 6–13.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sedlar, J., Vukičević, D. & Hansen, P. Using size for bounding expressions of graph invariants. Ann Oper Res 188, 415–427 (2011). https://doi.org/10.1007/s10479-010-0813-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-010-0813-z