Showing math.COShow all
3 papers · 1 filter
math.CO1999
Multiple vertex coverings by specified induced subgraphs
Zoltan Furedi, Dhruv Mubayi, Douglas B. West
Given graphs H_1,...,H_k, we study the minimum order of a graph G such that for each i, the induced copies of H_i in G cover V(G). We prove a general upper bound of twice the sum o…
math.CO1999
Edge-bandwidth of graphs
Tao Jiang, Dhruv Mubayi, Aditya Shastri +1
The edge-bandwidth of a graph is the minimum, over all labelings of the edges with distinct integers, of the maximum difference between labels of two incident edges. We prove that…
math.CO1998
Realizing degree imbalances in directed graphs
Dhruv Mubayi, Todd G. Will, Douglas B. West
In a directed graph, the imbalance of a vertex is its outdegree minus its indegree. We characterize the sequences that are realizable as the sequence of imbalances of a simple dire…