Pages that link to "Item:Q1422414"

The following pages link to Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures (Q1422414):

Displaying 44 items.

• On the extremal values of the second largest \(Q\)-eigenvalue (Q550643) (← links)
• Using size for bounding expressions of graph invariants (Q646725) (← links)
• Comparing Zagreb indices for connected graphs (Q708341) (← 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)
• Open problems on graph eigenvalues studied with AutoGraphiX (Q743636) (← 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)
• Facet defining inequalities among graph invariants: The system graphedron (Q944740) (← links)
• A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation (Q953839) (← 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)
• 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)
• 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)
• Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number (Q1043938) (← links)
• Automated conjecturing. III. Property-relations conjectures (Q1688717) (← links)
• On the relation between the positive inertia index and negative inertia index of weighted graphs (Q1713325) (← links)
• Proximity, remoteness and girth in graphs (Q1786868) (← links)
• Computers and discovery in algebraic graph theory (Q1855400) (← links)
• Relationship between the rank and the matching number of a graph (Q2011117) (← links)
• Nordhaus-Gaddum and other bounds for the sum of squares of the positive eigenvalues of a graph (Q2013183) (← links)
• Minimum values of the second largest \(Q\)-eigenvalue (Q2243135) (← links)
• A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments (Q2329497) (← links)
• The difference between remoteness and radius of a graph (Q2348060) (← links)
• Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs (Q2369038) (← links)
• The geometric-arithmetic index and the chromatic number of connected graphs (Q2410239) (← links)
• On the extremal cacti of given parameters with respect to the difference of Zagreb indices (Q2424819) (← links)
• Proof of conjectures on remoteness and proximity in graphs (Q2449108) (← links)
• Corrections of proofs for Hansen and Mélot's two theorems (Q2457018) (← links)
• On bags and bugs (Q2482094) (← links)
• Trees of extremal connectivity index (Q2581562) (← links)
• A CONJECTURE ON AVERAGE DISTANCE AND DIAMETER OF A GRAPH (Q2890990) (← links)
• Proximity and remoteness in graphs: Results and conjectures (Q3100689) (← links)
• AutoGraphiX: a survey (Q3439391) (← links)
• On the nullity number of graphs (Q5006628) (← links)
• On the Palindromic Hosoya Polynomial of Trees (Q5050719) (← links)
• Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille (Q5439393) (← links)