A nut graph is a singular graph with one-dimensional kernel and corresponding eigenvector with no zero elements. The problem of determining the orders n for which d-regular nut graphs exist was recently posed by Gauci, Pisanski and Sciriha. These orders are known for d ≤ 4. Here we solve the problem for all remaining cases d ≤ 11 and determine the complete lists of all dregular nut graphs of order n for small values of d and n. The existence or non-existence of small regular nut graphs is determined by a computer search. The main tool is a construction that produces, for any d-regular nut graph of order n, another d-regular nut graph of order n + 2d. If we are given a sufficient number of d-regular nut graphs of consecutive orders, called seed graphs, this construction may be applied in such a way that the existence of all d-regular nut graphs of higher orders is established. For even d the orders n are indeed consecutive, while for odd d the orders n are consecutive even numbers. Furthermore, necessary conditions for combinations of order and degree for vertex-transitive nut graphs are derived.
In this paper the problem of the existence of regular nut graphs is
addressed. A generalization of Fowler?s Construction which is a local
enlargement applied to a vertex in a graph is introduced to generate nut
graphs of higher order. Let N (?) denote the set of integers n such that
there exists a regular nut graph of degree ? and order n. It is proven that
N (3) = {12} ? {2k : k ? 9} and that N (4) = {8, 10, 12} ? {n : n ? 14}.
The problem of determining N (?) for ? > 4 remains completely open.
a b s t r a c tA function between graphs is k-to-1 if each point in the co-domain has precisely k preimages in the domain. Given two graphs, G and H, and an integer k ≥ 1, and considering G and H as subsets of R 3 , there may or may not be a k-to-1 continuous function (i.e. a k-to-1 map in the usual topological sense) from G onto H. In this paper we review and complete the determination of whether there are finitely discontinuous, or just infinitely discontinuous k-to-1 functions between two intervals, each of which is one of the following: ]0, 1[, [0, 1[ and [0, 1]. We also show that for k even and 1 ≤ r < 2s, (r, s) = (1, 1) and (r, s) = (3, 2), there is a k-to-1 map from K 2r onto K 2s if and only if k ≥ 2s.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.