Larry J. Langley

Learn More
Let G be a graph with n nodes, e edges, chromatic number and girth g. In an acyclic orientation of G, an arc is dependent if its reversal creates a cycle. It is well known that if < g, then G has an acyclic orientation without dependent arcs. Edelman showed that if G is connected, then every acyclic orientation has at most e ? n + 1 dependent arcs. We show(More)
Competition graphs were rst introduced by Joel Cohen in the study of food webs and have since been extensively studied. Graphs which are the competition graph of a strongly connected or Hamiltonian digraph are of particular interest in applications to communication networks. It has been previously established that every graph without isolated vertices(More)
A graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and nonprobes with an interval assigned to each vertex so that vertices are adjacent if and only if their corresponding intervals intersect and at least one of the vertices is a probe. When all intervals have the same length (or equivalently, no interval contains another(More)
A domination graph of a digraph D, dom(D), is created using the vertex set of D and edge {u, v} ∈ E[dom(D)] whenever (u, z) ∈ A(D) or (v, z) ∈ A(D) for every other vertex z ∈ V (D). The underlying graph of a digraph D, UG(D), is the graph for which D is a biorientation. We completely characterize digraphs whose underlying graphs are identical to their(More)