GRAFFITI
From MaRDI portal
Software:19524
swMATH7495MaRDI QIDQ19524FDOQ19524
Author name not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants
- Title not available (Why is that?)
- Functions on adjacent vertex degrees of trees with given degree sequence
- Proof of the first part of the conjecture of Aouchiche and Hansen about the Randić index
- A counterexample to the Alon-Saks-Seymour conjecture and related problems
- Some extremal graphs with respect to inverse degree
- Cubic polyhedral Ramanujan graphs with face size no larger than six
- On eccentric distance sum and degree distance of graphs
- Minimum size of a graph or digraph of given radius
- The harmonic index for graphs
- New bounds of degree-based topological indices for some classes of \(c\)-cyclic graphs
- Sharp bounds for the Randić index of graphs with given minimum and maximum degree
- The variation of the Randić index with regard to minimum and maximum degree
- A note on polyomino chains with extremum general sum-connectivity index
- \(k\)-domination and \(k\)-independence in graphs: A survey
- On atom-bond connectivity index of graphs
- Discovering theorems in game theory: two-person games with unique pure Nash equilibrium payoffs
- Bounds on Randić indices
- Relations between some topological indices and the line graph
- Zagreb indices of graphs
- Facet defining inequalities among graph invariants: The system graphedron
- On diameter and inverse degree of a graph
- Inverse degree and edge-connectivity
- AutoGraphiX: a survey
- Variable neighborhood search: Principles and applications
- On conjectures of Graffiti
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- Extremal graphs for weights
- Title not available (Why is that?)
- On the Randić index of graphs
- On a conjecture of the Randić index and the minimum degree of graphs
- About a conjecture on the Randić index of graphs
- A lower bound on the independence number of a graph
- Unicyclic graphs of given girth \(k\geq 4\) having smallest general sum-connectivity index
- On a conjecture of the harmonic index and the minimum degree of graphs
- The asymptotic value of the Randić index for trees
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Average distance and maximum induced forest
- Distance spectra of graphs: a survey
- On rank vs. communication complexity
- Matrix rank and communication complexity
- Total chromatic number and some topological indices
- Title not available (Why is that?)
- Some properties on the harmonic index of molecular trees
- On the total distance and diameter of graphs
- Title not available (Why is that?)
- Diameter and inverse degree
- Complete solution to a conjecture on Randić index
- A proof of two conjectures on the Randić index and the average eccentricity
- On a relation between the Randić index and the chromatic number
- Using stable sets to bound the chromatic number
- The relation of matching with inverse degree of a graph
- Title not available (Why is that?)
- A combination of Clar number and Kekulé count as an indicator of relative stability of fullerene isomers of \(\text C_{60}\)
- On structure-sensitivity of degree-based topological indices
- Diameter bounds for planar graphs
- Graphs with the strong Havel-Hakimi property
- On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence
- Computing the bipartite edge frustration of fullerene graphs
- On a conjecture of the Randić index
- The linear programming approach to the Randić index
- Average distance and independence number
- Some relations between rank, chromatic number and energy of graphs
- A unified linear-programming modeling of some topological indices
- 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
- Randić index and the diameter of a graph
- Independence and the Havel-Hakimi residue
- On conjecture of Graffiti
- Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
- A survey of automated conjectures in spectral graph theory
- Sharp bounds on the inverse sum indeg index
- Upper bounds for the achromatic and coloring numbers of a graph
- Mathematics for the nanocell approach to molecular electronics
- Independence and average distance in graphs
- A quadratic programming approach to the Randić index
- On the harmonic index and the chromatic number of a graph
- On the topological matrix and topological indices
- On generalized inverse sum indeg index and energy of graphs
- Extremal graphs for vertex-degree-based invariants with given degree sequences
- Bond incident degree (BID) indices of polyomino chains: a unified approach
- Harmonic index of a line graph
- The harmonic index of edge-semitotal graphs, total graphs and related sums
- Extremal polygonal cacti for bond incident degree indices
- Linear and non-linear inequalities on the inverse sum indeg index
- Harmonic index and its generalizations: extremal results and bounds
- Inverse degree, Randić index and harmonic index of graphs
- On the sum of \(k\) largest distance eigenvalues of graphs
- Inequalities on the inverse degree index
- The harmonic index of two-trees and quasi-tree graphs
- Bounds for symmetric division deg index of graphs
- Some computational aspects of boron triangular nanotubes
- The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs
- Proof of a conjecture involving the second largest \(D\)-eigenvalue and the number of triangles
- Zero forcing versus domination in cubic graphs
- Unified extremal results for \(k\)-apex unicyclic graphs (trees)
- Graph products and eccentric harmonic index
- Graph entropies, enumeration of circuits, walks and topological properties of three classes of isoreticular metal organic frameworks
- Sombor index: review of extremal results and bounds
- Spectral properties of inverse sum indeg index of graphs
This page was built for software: GRAFFITI