The Transitivity of Special Graph Classes
Document Type
Article
Publication Date
8-1-2019
Description
Let G = (V,E) be a graph. The transitivity of a graph G, denoted Tr(G), equals the maximum order k of a partition x = {Vi,of V such that for every i,j, 1 i j k, Vi dominates Vj. We consider the transitivity in many special classes of graphs, including cactus graphs, coronas, Cartesian products, and joins. We also consider the effects of vertex or edge deletion and edge addition on the transivity of a graph.
Citation Information
Haynes, Teresa W.; Hedetniemi, Jason T.; Hedetniemi, Stephen T.; McRae, Alice; and Phillips, Nicholas. 2019. The Transitivity of Special Graph Classes. Journal of Combinatorial Mathematics and Combinatorial Computing. Vol.110 181-204. ISSN: 0835-3026