AutoGraphiX

swMATH6137MaRDI QIDQ18271FDOQ18271

Author name not available (Why is that?)

Described by source

• AutoGraphiX: a survey

Cited In (only showing first 100 items - show all)

• Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants
• Graphs with small spectral gap
• Proof of the first part of the conjecture of Aouchiche and Hansen about the Randić index
• On the Zagreb index inequality of graphs with prescribed vertex degrees
• On eccentric distance sum and degree distance of graphs
• Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille
• Some properties of the distance Laplacian eigenvalues of a graph.
• Title not available (Why is that?)
• 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
• On a conjecture about the Szeged index
• Title not available (Why is that?)
• Sharp bounds for Zagreb indices of maximal outerplanar graphs
• On the extremal values of the second largest \(Q\)-eigenvalue
• On the further relation between the (revised) Szeged index and the Wiener index of graphs
• Facet defining inequalities among graph invariants: The system graphedron
• On the Laplacian coefficients of unicyclic graphs
• Variable neighbourhood search: Methods and applications
• Title not available (Why is that?)
• On the maximum Zagreb indices of graphs with \(k\) cut vertices
• Comparing the Zagreb indices for graphs with small difference between the maximum and minimum degrees
• Variable neighborhood search: Principles and applications
• Bounds and conjectures for the signless Laplacian index of graphs
• Variable neighbourhood search: methods and applications
• Bounds on the \(Q\)-spread of a graph
• On the Randić index of graphs
• Randić ordering of chemical trees
• About a conjecture on the Randić index of graphs
• Centrality and betweenness: vertex and edge decomposition of the Wiener index
• Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
• Proof of conjectures involving algebraic connectivity of graphs
• Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
• Average distance and maximum induced forest
• Title not available (Why is that?)
• On mean distance and girth
• Proximity, remoteness and distance eigenvalues of a graph
• On the nullity number of graphs
• Old and new results on algebraic connectivity of graphs
• Distance spectra of graphs: a survey
• Some upper bounds related with domination number
• On bags and bugs
• Extremal graphs for the sum of the two largest signless Laplacian eigenvalues
• A recipe for finding good solutions to MINLPs
• On the spectral radius of graphs with a given domination number
• Title not available (Why is that?)
• On the total distance and diameter of graphs
• Design of highly synchronizable and robust networks
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• Minimum values of the second largest \(Q\)-eigenvalue
• On a relation between the Randić index and the chromatic number
• On a conjecture about the Randić index
• Comparing Zagreb indices for connected graphs
• Nordhaus-Gaddum relations for proximity and remoteness in graphs
• Title not available (Why is that?)
• Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
• A survey of Nordhaus-Gaddum type relations
• The (revised) Szeged index and the Wiener index of a nonbipartite graph
• Bicyclic graphs with maximal revised Szeged index
• Title not available (Why is that?)
• Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph
• Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number
• Variable neighborhood search for extremal graphs. XIV: The AutoGraphiX 2 system
• Using size for bounding expressions of graph invariants
• Proximity and remoteness in graphs: results and conjectures
• Proximity, remoteness and girth in graphs
• On the extremal properties of the average eccentricity
• On the extremal energy of bicyclic digraphs
• On a relation between Szeged and Wiener indices of bipartite graphs
• Upper bounds on the average eccentricity
• On a conjecture of the Randić index
• Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs
• Minimum general Randić index on chemical trees with given order and number of pendent vertices
• On two conjectures of Randić index and the largest signless Laplacian eigenvalue of graphs
• Randić index and the diameter of a graph
• FuiGui: a graphical user interface for investigating conjectures about fullerenes
• Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
• A survey of automated conjectures in spectral graph theory
• Proof of conjectures on remoteness and proximity in graphs
• Tetracyclic graphs with extremal values of Randić index
• The difference between remoteness and radius of a graph
• 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
• Conjectures of TxGraffiti: independence, domination, and matchings
• Metric properties of Sierpiński-like graphs
• Corrections of proofs for Hansen and Mélot's two theorems
• On the Randić index of polyomino chains
• Further results regarding the sum of domination number and average eccentricity
• Title not available (Why is that?)
• Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
• Computers and discovery in algebraic graph theory
• The Wiener index of Sierpiński-like graphs
• Variable neighborhood search for extremal graphs.17. Further conjectures and results about the index
• 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
• Proof of conjecture involving algebraic connectivity and average degree of graphs
• On some properties of graph irregularity indices with a particular regard to the \(\sigma \)-index
• Nordhaus-Gaddum and other bounds for the sum of squares of the positive eigenvalues of a graph
• Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity
• Resolution of AutoGraphiX conjectures relating the index and matching number of graphs

This page was built for software: AutoGraphiX