AutoGraphiX
From MaRDI portal
Software:18271
No author found.
Related Items (only showing first 100 items - show all)
On the further relation between the (revised) Szeged index and the Wiener index of graphs ⋮ Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs ⋮ Problems of discrete optimization: challenges and main approaches to solve them ⋮ Eccentricity-based topological indices of a cyclic octahedron structure ⋮ Proximity, remoteness and distance eigenvalues of a graph ⋮ On a conjecture about the Randić index ⋮ On the extremal properties of the average eccentricity ⋮ Sharp bounds for the Randić index of graphs with given minimum and maximum degree ⋮ Old and new results on algebraic connectivity of graphs ⋮ On maximum Wiener index of trees and graphs with given radius ⋮ The geometric-arithmetic index and the chromatic number of connected graphs ⋮ On mean distance and girth ⋮ A recipe for finding good solutions to MINLPs ⋮ Automated conjecturing. III. Property-relations conjectures ⋮ Design of highly synchronizable and robust networks ⋮ Further results on the Merrifield-Simmons index ⋮ About a conjecture on the Randić index of graphs ⋮ On the extremal cacti of given parameters with respect to the difference of Zagreb indices ⋮ Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited ⋮ A survey of Nordhaus-Gaddum type relations ⋮ Randić index and the diameter of a graph ⋮ Comparative results and bounds for the eccentric-adjacency index ⋮ Edge-grafting transformations on the average eccentricity of graphs and their applications ⋮ Proof of conjectures involving algebraic connectivity of graphs ⋮ A quadratic programming approach to the Randić index ⋮ A proof of the conjecture regarding the sum of domination number and average eccentricity ⋮ Proof of the first part of the conjecture of Aouchiche and Hansen about the Randić index ⋮ Expected distance based on random walks ⋮ Upper bounds on the average eccentricity ⋮ The (revised) Szeged index and the Wiener index of a nonbipartite graph ⋮ On the relation between the positive inertia index and negative inertia index of weighted graphs ⋮ Using size for bounding expressions of graph invariants ⋮ Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures ⋮ Bicyclic graphs with maximal revised Szeged index ⋮ On the harmonic index and the chromatic number of a graph ⋮ Some upper bounds related with domination number ⋮ Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity ⋮ Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index ⋮ Proof of conjectures on remoteness and proximity in graphs ⋮ Variable neighborhood search for extremal graphs. I: The AutoGraphiX system ⋮ Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph ⋮ Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search ⋮ Corrections of proofs for Hansen and Mélot's two theorems ⋮ Further results regarding the sum of domination number and average eccentricity ⋮ Metric properties of Sierpiński-like graphs ⋮ Tetracyclic graphs with extremal values of Randić index ⋮ Facet defining inequalities among graph invariants: The system graphedron ⋮ Welfare targeting in networks ⋮ The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs ⋮ The Wiener index of Sierpiński-like graphs ⋮ Minimum values of the second largest \(Q\)-eigenvalue ⋮ Proof of conjecture involving algebraic connectivity and average degree of graphs ⋮ Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number ⋮ Distance spectra of graphs: a survey ⋮ On the spectral radius of graphs with a given domination number ⋮ A survey of automated conjectures in spectral graph theory ⋮ Bounds on the \(Q\)-spread of a graph ⋮ On the Laplacian coefficients of unicyclic graphs with prescribed matching number ⋮ On the Zagreb index inequality of graphs with prescribed vertex degrees ⋮ On bags and bugs ⋮ Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance ⋮ A sharp upper bound on algebraic connectivity using domination number ⋮ Bounds and conjectures for the signless Laplacian index of graphs ⋮ Variable neighbourhood search: methods and applications ⋮ On some properties of graph irregularity indices with a particular regard to the \(\sigma \)-index ⋮ Relationship between the rank and the matching number of a graph ⋮ On the extremal values of the second largest \(Q\)-eigenvalue ⋮ Nordhaus-Gaddum and other bounds for the sum of squares of the positive eigenvalues of a graph ⋮ Comparing Zagreb indices for connected graphs ⋮ On a relation between the Randić index and the chromatic number ⋮ On a conjecture about the Szeged index ⋮ Resolution of AutoGraphiX conjectures relating the index and matching number of graphs ⋮ On two conjectures of Randić index and the largest signless Laplacian eigenvalue of graphs ⋮ On the maximum Zagreb indices of graphs with \(k\) cut vertices ⋮ Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph ⋮ The Randić index and the diameter of graphs ⋮ Sharp bounds for Zagreb indices of maximal outerplanar graphs ⋮ Nordhaus-Gaddum relations for proximity and remoteness in graphs ⋮ Cospectrality of graphs with respect to distance matrices ⋮ Comment on ``complete solution to a conjecture on Randić index ⋮ Proximity, remoteness and girth in graphs ⋮ Relation between the skew-rank of an oriented graph and the independence number of its underlying graph ⋮ On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph ⋮ Proofs of three conjectures on the quotients of the (revised) Szeged index and the Wiener index and beyond ⋮ On eccentric distance sum and degree distance of graphs ⋮ Automated generation of conjectures on forbidden subgraph characterization ⋮ Open problems on graph eigenvalues studied with AutoGraphiX ⋮ On the Laplacian coefficients of unicyclic graphs ⋮ Comparative study of distance-based graph invariants ⋮ On a conjecture of the Randić index ⋮ Comparing the Zagreb indices for graphs with small difference between the maximum and minimum degrees ⋮ Variable neighbourhood search: Methods and applications ⋮ On the Randić index of graphs ⋮ Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number ⋮ Randić ordering of chemical trees ⋮ Computers and discovery in algebraic graph theory ⋮ The difference between remoteness and radius of a graph ⋮ A note on Zagreb indices inequality for trees and unicyclic graphs ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for software: AutoGraphiX
