2 citations · 3 across the 5 of their papers we have counts for
5 papers
Serre's Properties for Quadratic Generated Domains from Graphs
Drew J. Lipman, Michael A. Burr
For any graph, one can construct a ring, called the edge ring, which is a quadratic-monomial generated subring of the Laurent polynomial ring . In…
Partial Domination in Graphs
Benjamin M. Case, Stephen T. Hedetniemi, Renu C. Laskar +1
A set is a dominating set of if every vertex in is adjacent to at least one vertex in . The domination number of equals the minimum cardina…
Quadratic Generated Normal Domains From Graphs
Drew J. Lipman, Michael A. Burr
Determining whether an arbitrary subring of is a normal domain is, in general, a nontrivial problem, even in the special case of a monomial…
Cycle Domination, Independence and Irredundance in graphs
Amy Grady, Fiona Knoll, Renu Laskar +1
A set of vertices in a graph is called {\em cycle independent} if the induced subgraph is acyclic, and called {\em odd-cycle indepdendet} if $\l…
Intersections of Cycling 2-factors
Drew J. Lipman
Define an embedding of graph with a finite set of distinct points on the unit circle and the set of line segments connecting the points. Let be a…