Domination Cover Pebbling: Structural Results

This paper continues the results of "Domination Cover Pebbling: Graph Families." An almost sharp bound for the domination cover pebbling (DCP) number for graphs G with specified diameter has been computed. For graphs of diameter two, a bound for the ratio between the cover pebbling number of G and the DCP number of G has been computed. A variant of domination cover pebbling, called subversion DCP is introducted, and preliminary results are discussed.Comment: 15 page

On the number of outer automorphisms of the automorphism group of a right-angled Artin group

We show that there is no uniform upper bound on |Out(Aut(A))| when A ranges over all right-angled Artin groups. This is in contrast with the cases where A is free or free abelian: for all n, Dyer-Formanek and Bridson-Vogtmann showed that Out(Aut(F_n)) = 1, while Hua-Reiner showed |Out(Aut(Z^n)| = |Out(GL(n,Z))| < 5. We also prove the analogous theorem for Out(Out(A)). We establish our results by giving explicit examples; one useful tool is a new class of graphs called austere graphs

Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs

A path in an edge-colored graph $G$ is rainbow if no two edges of it are colored the same. The graph $G$ is rainbow-connected if there is a rainbow path between every pair of vertices. If there is a rainbow shortest path between every pair of vertices, the graph $G$ is strongly rainbow-connected. The minimum number of colors needed to make $G$ rainbow-connected is known as the rainbow connection number of $G$, and is denoted by $\text{rc}(G)$. Similarly, the minimum number of colors needed to make $G$ strongly rainbow-connected is known as the strong rainbow connection number of $G$, and is denoted by $\text{src}(G)$. We prove that for every $k \geq 3$, deciding whether $\text{src}(G) \leq k$ is NP-complete for split graphs, which form a subclass of chordal graphs. Furthermore, there exists no polynomial-time algorithm for approximating the strong rainbow connection number of an $n$-vertex split graph with a factor of $n^{1/2-\epsilon}$ for any $\epsilon > 0$ unless P = NP. We then turn our attention to block graphs, which also form a subclass of chordal graphs. We determine the strong rainbow connection number of block graphs, and show it can be computed in linear time. Finally, we provide a polynomial-time characterization of bridgeless block graphs with rainbow connection number at most 4.Comment: 13 pages, 3 figure