Pages that link to "Item:Q1970574"
From MaRDI portal
The following pages link to Variable neighborhood search for extremal graphs. I: The AutoGraphiX system (Q1970574):
Displaying 50 items.
- On the further relation between the (revised) Szeged index and the Wiener index of graphs (Q277640) (← links)
- Proximity, remoteness and distance eigenvalues of a graph (Q313783) (← links)
- Complete characterization of graphs for direct comparing Zagreb indices (Q323061) (← links)
- On the extremal properties of the average eccentricity (Q356266) (← links)
- Some upper bounds related with domination number (Q457547) (← links)
- Tetracyclic graphs with extremal values of Randić index (Q496265) (← links)
- On the Zagreb index inequality of graphs with prescribed vertex degrees (Q534355) (← links)
- On the extremal values of the second largest \(Q\)-eigenvalue (Q550643) (← links)
- On mean distance and girth (Q608268) (← links)
- Design of highly synchronizable and robust networks (Q620598) (← links)
- Randić index and the diameter of a graph (Q627931) (← links)
- Using size for bounding expressions of graph invariants (Q646725) (← links)
- Comparing Zagreb indices for connected graphs (Q708341) (← links)
- On a relation between the Randić index and the chromatic number (Q708405) (← links)
- On a conjecture about the Szeged index (Q709235) (← links)
- Resolution of AutoGraphiX conjectures relating the index and matching number of graphs (Q710882) (← links)
- Relation between the skew-rank of an oriented graph and the independence number of its underlying graph (Q724735) (← links)
- On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph (Q725520) (← links)
- Proofs of three conjectures on the quotients of the (revised) Szeged index and the Wiener index and beyond (Q729760) (← links)
- On difference of Zagreb indices (Q741537) (← links)
- Automated generation of conjectures on forbidden subgraph characterization (Q741737) (← links)
- Open problems on graph eigenvalues studied with AutoGraphiX (Q743636) (← links)
- On the Zagreb indices equality (Q765330) (← links)
- On a conjecture about the Randić index (Q864167) (← links)
- Old and new results on algebraic connectivity of graphs (Q876302) (← links)
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Q899436) (← links)
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph (Q932184) (← links)
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search (Q933803) (← links)
- Facet defining inequalities among graph invariants: The system graphedron (Q944740) (← links)
- Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number (Q955318) (← links)
- A survey of automated conjectures in spectral graph theory (Q962119) (← links)
- Bounds on the \(Q\)-spread of a graph (Q962122) (← links)
- Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance (Q967410) (← links)
- A sharp upper bound on algebraic connectivity using domination number (Q967504) (← links)
- Bounds and conjectures for the signless Laplacian index of graphs (Q968999) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Nordhaus-Gaddum relations for proximity and remoteness in graphs (Q988253) (← links)
- Comment on ``complete solution to a conjecture on Randić index'' (Q992642) (← links)
- On the Laplacian coefficients of unicyclic graphs (Q1014495) (← links)
- On a conjecture of the Randić index (Q1026136) (← links)
- Comparing the Zagreb indices for graphs with small difference between the maximum and minimum degrees (Q1028145) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- GrInvIn in a nutshell (Q1029769) (← links)
- Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number (Q1043938) (← links)
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures (Q1422414) (← links)
- Eccentricity-based topological indices of a cyclic octahedron structure (Q1634409) (← links)
- Sharp bounds for the Randić index of graphs with given minimum and maximum degree (Q1671320) (← links)
- Automated conjecturing. III. Property-relations conjectures (Q1688717) (← links)
- Edge-grafting transformations on the average eccentricity of graphs and their applications (Q1701119) (← links)
- Expected distance based on random walks (Q1708510) (← links)
