On the power propagation time of a graph

MaRDI QIDQ6276201zbMATH OpenFDO

Authors Chassidy Bozeman

Publication date 3 August 2016

Abstract: In this paper, we give Nordhaus-Gaddum upper and lower bounds on the sum of the power propagation time of a graph and its complement, and we consider the effects of edge subdivisions and edge contractions on the power propagation time of a graph. We also study a generalization of power propagation time, known as $k-$power propagation time, by characterizing all simple graphs on $n$ vertices whose $k-$power propagation time is $n-1$ or $n-2$ (for $kgeq1$) and $n-3$ (for $kgeq2$). We determine all trees on $n$ vertices whose power propagation time ($k=1$) is $n-3$, and give partial characterizations of graphs whose $k-$power propagation time is equal to 1 (for $kgeq1$).

This page was built for publication: On the power propagation time of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6276201)