Strong transitivity of a graph

2023/10/06 by Subhabrata Paul, Kamal Santra, Paul, Subhabrata +1
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.2310.04476

openalex publication_date 2023/10/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01

Abstract

A vertex partition π= \V₁, V₂, …, V_k\ of G is called a transitive partition of size k if V_i dominates V_j for all 1≤ i

Related

• Algorithmic study of d₂-transitivity of graphs
• Algorithmic study on 2-transitivity of graphs
• Transitivity on subclasses of bipartite graphs
• Tournament transitivity of graphs
• Transitivity on subclasses of chordal graphs