swMATH6137MaRDI QIDQ18271FDOQ18271
Author name not available (Why is that?)
Official website: https://www.autographix.ca
Cited In (only showing first 100 items - show all)
- On the Zagreb index inequality of graphs with prescribed vertex degrees
- 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
- On the Randić index of polyomino chains
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
- Computers and discovery in algebraic graph theory
- 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
- On the extremal values of the second largest \(Q\)-eigenvalue
- Resolution of AutoGraphiX conjectures relating the index and matching number of graphs
- The Randić index and the diameter of 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
- Comment on ``complete solution to a conjecture on Randić index
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille
- On maximum Wiener index of trees and graphs with given radius
- On mean distance and girth
- AutoGraphiX: an automated system for finding conjectures in graph theory
- Automated generation of conjectures on forbidden subgraph characterization
- Open problems on graph eigenvalues studied with AutoGraphiX
- Variable Zagreb indices and Karamata's inequality
- A sharp upper bound on algebraic connectivity using domination number
- Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance
- Design of highly synchronizable and robust networks
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
- Minimum values of the second largest \(Q\)-eigenvalue
- Relationship between the rank and the matching number of a graph
- A proof of the conjecture regarding the sum of domination number and average eccentricity
- What forms do interesting conjectures have in graph theory?
- 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
- Variable neighborhood search for extremal graphs. 18. Conjectures and results about Randić index
- Automated conjecturing. III. Property-relations conjectures
- A survey of research in automated mathematical conjecture-making
- Using size for bounding expressions of graph invariants
- On the extremal energy of bicyclic digraphs
- Welfare targeting in networks
- On a conjecture of the Randić index
- Eccentricity-based topological indices of a cyclic octahedron structure
- 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
- Expected distance based on random walks
- On the relation between the positive inertia index and negative inertia index of weighted graphs
- Variable neighborhood search for extremal graphs 3
- On harmonic indices of trees, unicyclic graphs and bicyclic graphs.
- Conjectures of TxGraffiti: independence, domination, and matchings
- Metric properties of Sierpiński-like graphs
- Further results regarding the sum of domination number and average eccentricity
- The Wiener index of Sierpiński-like graphs
- 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
- Comparing variable Zagreb indices of graphs
- The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs
- On the extremal cacti of given parameters with respect to the difference of Zagreb indices
- Cospectrality of graphs with respect to distance matrices
- Comparative study of distance-based graph invariants
- Three examples of a ground-breaking impact of the variable neighborhood search on investigations in graph theory
- The average eccentricity of a graph with prescribed girth
- On autographix conjecture regarding domination number and average eccentricity
- A stronger relation between coloring number and the modification of Randić index.
- Distance Laplacian eigenvalues and chromatic number in graphs
- A note on Zagreb indices inequality for trees and unicyclic graphs
- Comparative results and bounds for the eccentric-adjacency index
- Further results on the Merrifield-Simmons index
- On a relation between Randić index and algebraic connectivity
- 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 eccentric distance sum and degree distance of graphs
- Some properties of the distance Laplacian eigenvalues of a graph.
- 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 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
- Average distance and maximum induced forest
- Title not available (Why is that?)
This page was built for software: AutoGraphiX
