Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"automated conjecturing"”.

  1. Automated Conjecturing Approach for Benzenoids

    … of on our own, rather generated by a process of automated conjecture-making. This program, named Cᴏɴᴊᴇᴄᴛᴜʀɪɴɢ, is developed by Craig Larson and Nico Van Cleemput.

    vcu Repository record for Automated Conjecturing Approach for Benzenoids (opens in a new tab)

  2. Automated Conjecturing Approach to the Discrete Riemann Hypothesis

    … and also seek new bounds with the help of an automated conjecture-making program named CONJECTURING, which was created by C. Larson and N. Van Cleemput, and inspired by Fajtowicz's Dalmatian Heuristic. By utilizing this powerful program, we were able to form, validate, and disprove hypotheses …

    vcu Repository record for Automated Conjecturing Approach to the Discrete Riemann Hypothesis (opens in a new tab)

  3. AUTOMATED CONJECTURING ON THE INDEPENDENCE NUMBER AND MINIMUM DEGREE OF DIAMETER-2-CRITICAL GRAPHS

    A diameter-2-critical (D2C) graph is a graph with diameter two such that removing any edge increases the diameter or disconnects the graph. In this paper, we look at other lesser-studied properties of D2C graphs, focusing mainly on their independence number and minimum degree. We show that there …

    vcu Repository record for AUTOMATED CONJECTURING ON THE INDEPENDENCE NUMBER AND MINIMUM DEGREE OF DIAMETER-2-CRITICAL GRAPHS (opens in a new tab)