Transitivity on subclasses of chordal graphs

2022/11/25 by Subhabrata Paul, Kamal Santra, Paul, Subhabrata +1
Computer Science · Mathematics · #Advanced Graph Theory Research #Advanced Topology and Set Theory #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.2211.13931

openalex publication_date 2022/11/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let G=(V, E) be a graph, where V and E are the vertex and edge sets, respectively. For two disjoint subsets A and B of V, we say A dominates B if every vertex of B is adjacent to at least one vertex of A in G. 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 bipartite graphs
• Algorithmic study of d₂-transitivity of graphs
• Algorithmic study on 2-transitivity of graphs
• Tournament transitivity of graphs
• Strong transitivity of a graph