AutoGraphiX
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance
- Design of highly synchronizable and robust networks
- Variable Zagreb indices and Karamata's inequality
- scientific article; zbMATH DE number 1488097 (Why is no real title available?)
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- On the total distance and diameter of graphs
- On a relation between the Randić index and the chromatic number
- On a conjecture about the Randić index
- Minimum values of the second largest \(Q\)-eigenvalue
- Comparing Zagreb indices for connected graphs
- Nordhaus-Gaddum relations for proximity and remoteness in graphs
- Relationship between the rank and the matching number of a graph
- Comparative study of distance-based graph invariants
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- scientific article; zbMATH DE number 7410923 (Why is no real title available?)
- A survey of Nordhaus-Gaddum type relations
- A proof of the conjecture regarding the sum of domination number and average eccentricity
- The (revised) Szeged index and the Wiener index of a nonbipartite graph
- Bicyclic graphs with maximal revised Szeged index
- What forms do interesting conjectures have in graph theory?
- Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph
- How far is, should and could be conjecture-making in graph theory an automated process?
- Variable neighborhood search for extremal graphs. IX: Bounding the irregularity of a graph
- Automated conjecturing. III. Property-relations conjectures
- scientific article; zbMATH DE number 5130720 (Why is no real title available?)
- Using size for bounding expressions of graph invariants
- Variable neighborhood search for extremal graphs. 18. Conjectures and results about Randić index
- Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number
- On the extremal properties of the average eccentricity
- The average eccentricity of a graph with prescribed girth
- Three examples of a ground-breaking impact of the variable neighborhood search on investigations in graph theory
- A survey of research in automated mathematical conjecture-making
- Proximity, remoteness and girth in graphs
- Proximity and remoteness in graphs: results and conjectures
- Variable neighborhood search for extremal graphs. XIV: The AutoGraphiX 2 system
- On autographix conjecture regarding domination number and average eccentricity
- On the extremal energy of bicyclic digraphs
- On a conjecture of the Randić index
- Welfare targeting in networks
- A stronger relation between coloring number and the modification of Randić index.
- Upper bounds on the average eccentricity
- On a relation between Szeged and Wiener indices of bipartite graphs
- Distance Laplacian eigenvalues and chromatic number in graphs
- Randić index and the diameter of a graph
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs
- On two conjectures of Randić index and the largest signless Laplacian eigenvalue of graphs
- Minimum general Randić index on chemical trees with given order and number of pendent vertices
- Eccentricity-based topological indices of a cyclic octahedron structure
- A note on Zagreb indices inequality for trees and unicyclic graphs
- Edge-grafting transformations on the average eccentricity of graphs and their applications
- Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index
- Comparative results and bounds for the eccentric-adjacency index
- Further results on the Merrifield-Simmons index
- Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
- A survey of automated conjectures in spectral graph theory
- FuiGui: a graphical user interface for investigating conjectures about fullerenes
- On a relation between Randić index and algebraic connectivity
- Expected distance based on random walks
- On the relation between the positive inertia index and negative inertia index of weighted graphs
- Tetracyclic graphs with extremal values of Randić index
- Proof of conjectures on remoteness and proximity in graphs
- Variable neighborhood search for extremal graphs 3
- The difference between remoteness and radius of a graph
- On harmonic indices of trees, unicyclic graphs and bicyclic graphs.
- Problems of discrete optimization: challenges and main approaches to solve them
- A quadratic programming approach to the Randić index
- On the harmonic index and the chromatic number of a graph
- Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants
- Conjectures of TxGraffiti: independence, domination, and matchings
- Metric properties of Sierpiński-like graphs
- Graphs with small spectral gap
- On the Zagreb index inequality of graphs with prescribed vertex degrees
- Proof of the first part of the conjecture of Aouchiche and Hansen about the Randić index
- On eccentric distance sum and degree distance of graphs
- Corrections of proofs for Hansen and Mélot's two theorems
- Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille
- Further results regarding the sum of domination number and average eccentricity
- Some properties of the distance Laplacian eigenvalues of a graph.
- On the Randić index of polyomino chains
- Sharp bounds for the Randić index of graphs with given minimum and maximum degree
- On the Laplacian coefficients of unicyclic graphs with prescribed matching number
- Computers and discovery in algebraic graph theory
- scientific article; zbMATH DE number 2239312 (Why is no real title available?)
- Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
- scientific article; zbMATH DE number 6127697 (Why is no real title available?)
- The Wiener index of Sierpiński-like graphs
- On a conjecture about the Szeged index
- Sharp bounds for Zagreb indices of maximal outerplanar graphs
- The geometric-arithmetic index and the chromatic number of connected graphs
- Proofs of three conjectures on the quotients of the (revised) Szeged index and the Wiener index and beyond
- Variable neighborhood search for extremal graphs.17. Further conjectures and results about the index
- On the further relation between the (revised) Szeged index and the Wiener index of graphs
- On the extremal values of the second largest \(Q\)-eigenvalue
- scientific article; zbMATH DE number 5255694 (Why is no real title available?)
- Facet defining inequalities among graph invariants: The system graphedron
- Proof of conjecture involving algebraic connectivity and average degree of graphs
- On the Laplacian coefficients of unicyclic graphs
- Variable neighbourhood search: Methods and applications
- On some properties of graph irregularity indices with a particular regard to the \(\sigma \)-index
This page was built for software: AutoGraphiX