Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Mathematics
On The Singular Pebbling Number Of A Graph, Harmony R. Morris
On The Singular Pebbling Number Of A Graph, Harmony R. Morris
Rose-Hulman Undergraduate Mathematics Journal
In this paper, we define a new parameter of a connected graph as a spin-off of the pebbling number (which is the smallest t such that every supply of t pebbles can satisfy every demand of one pebble). This new parameter is the singular pebbling number, the smallest t such that a player can be given any configuration of at least t pebbles and any target vertex and can successfully move pebbles so that exactly one pebble ends on the target vertex. We also prove that the singular pebbling number of any graph on 3 or more vertices is equal …
Paths And Circuits In G-Graphs Of Certain Non-Abelian Groups, A. Dewitt, A. Rodriguez, Jennifer Daniel
Paths And Circuits In G-Graphs Of Certain Non-Abelian Groups, A. Dewitt, A. Rodriguez, Jennifer Daniel
Furman University Electronic Journal of Undergraduate Mathematics
In [BJRTD08], necessary and suffcient conditions were given for the existence of Eulerian and Hamiltonian paths and circuits in the G-graph of the dihedral group Dn. In this paper, we consider the G-graphs of the quasihedral, modular, and generalized quaternion group. These groups are of rank 2 and we consider only the graphs Γ(G, S) where |S|= 2.