Title

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.

This document is currently not available here.

Share

COinS