This function recursively applies transformations to enumerate prime cubic graphs starting from the K4 graph. It calls relevant functions to check the irreducibility of edges and manage duplicates.

Kaszonyi function original First checks whether graph is 3-edge-colorable. For graphs that are not 3-edge-colorable computes the Kaszonyi function values for every edge of given graphs according to ...

We also varied the true mathematical function which generated the data. We generated scatterplots from straight (linear) functions, one curve (quadratic) functions, and from functions that form two ...

The cubic fuzzy graph structure is a tool for modeling problems, in which there are two fuzzy values for each variable and the relationships between them that cannot be expressed as a single fuzzy ...

The cubic fuzzy graph structure, as a combination of cubic fuzzy graphs and fuzzy graph structures, shows better capabilities in solving complex problems, especially in cases where there are multiple ...

more about quadratic functions and their graphs, be able to recognise two further types of functions and graphs – cubic functions and reciprocal functions.

We classify those cubic m-variable Boolean functions which are (m-4)-resilient. We prove that there are four types of such functions, depending on the structure of the support of their Walsh spectra.

We classify those cubic m-variable Boolean functions which are (m $4)-resilient. Our main result is that there are four types of such functions, depending on the structure of the support of their ...