Transitivity on subclasses of bipartite graphs

2022/04/27 by Paul, Subhabrata, Santra, Kamal
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics

paper · doi:10.48550/arxiv.2204.13148

Abstract

Let G=(V, E) be a graph where V and E are the vertex and edge set, respectively. For two disjoint subsets A and B, we say A dominates B if every vertex of B is adjacent to at least one vertex of A. A vertex partition π= \V₁, V₂, …, V_k\ of G is called a transitive k-partition if V_i dominates V_j for all i,j where 1≤ i

Related

• Transitivity on subclasses of chordal graphs
• Algorithmic study on 2-transitivity of graphs
• Algorithmic study of d₂-transitivity of graphs
• Tournament transitivity of graphs
• Strong transitivity of a graph