AutoGraphiX
AutoGraphiX (AGX) is a computer system designed to help researchers in graph theory. The main purpose of AGX is to search for extremal graphs, i.e., graphs minimizing of maximizing a graph invariant (or a function of graph invariants, which could also be considered as an invariant). From this main capability, some information on the extremal graphs could be extracted and conjectures may be generated automatically or found by the researcher. ..
(Source: http://dl.acm.org/)
Keywords for this software
References in zbMATH (referenced in 130 articles , 1 standard article )
Showing results 1 to 20 of 130.
Sorted by year (- Dalfó, C.: On the Randić index of graphs (2019)
- Feng, Zhimin; Huang, Jing; Li, Shuchao; Luo, Xiaobing: Relationship between the rank and the matching number of a graph (2019)
- Li, Shuchao; Sun, Wanting: On the relation between the positive inertia index and negative inertia index of weighted graphs (2019)
- Li, Shuchao; Zhang, Licheng; Zhang, Minjie: On the extremal cacti of given parameters with respect to the difference of Zagreb indices (2019)
- Réti, Tamás: On some properties of graph irregularity indices with a particular regard to the (\sigma)-index (2019)
- Zhang, Huihui; Li, Shuchao; Xu, Baogen: Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index (2019)
- Aouchiche, Mustapha; Hansen, Pierre: Cospectrality of graphs with respect to distance matrices (2018)
- Camby, E.; Caporossi, Gilles; Paiva, M. H. M.; Segatto, Marcia E. V.: Expected distance based on random walks (2018)
- Das, Kinkar Ch.: Proof of conjecture involving algebraic connectivity and average degree of graphs (2018)
- He, Chunling; Li, Shuchao; Tu, Jianwei: Edge-grafting transformations on the average eccentricity of graphs and their applications (2018)
- Hua, Hongbo: On the total distance and diameter of graphs (2018)
- Hua, Hongbo; Wang, Hongzhuan; Hu, Xiaolan: On eccentric distance sum and degree distance of graphs (2018)
- Huang, Jing; Li, Shuchao; Wang, Hua: Relation between the skew-rank of an oriented graph and the independence number of its underlying graph (2018)
- Luo, Chunmei; Zuo, Liancui; Zhang, Philip B.: The Wiener index of Sierpiński-like graphs (2018)
- Luo, Wenjun; Huang, Jing; Li, Shuchao: On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph (2018)
- O, Suil; Shi, Yongtang: Sharp bounds for the Randić index of graphs with given minimum and maximum degree (2018)
- Zahid, Manzoor Ahmed; Baig, Abdul Qudair; Naeem, Muhammad; Azhar, Muhammad Razwan: Eccentricity-based topological indices of a cyclic octahedron structure (2018)
- Aouchiche, M.; Hansen, P.: Proximity, remoteness and girth in graphs (2017)
- Aouchiche, Mustapha; Hansen, Pierre: The geometric-arithmetic index and the chromatic number of connected graphs (2017)
- Das, Kinkar Ch.; Nadjafi-Arani, M. J.: On maximum Wiener index of trees and graphs with given radius (2017)
Further publications can be found at: https://www.gerad.ca/Gilles.Caporossi/agx/AGX/References.html