2024/08/30 by Kamal Santra, Santra, Kamal
Computer Science · Mathematics · Physics and Astronomy · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complex Network Analysis Techniques #FOS: Mathematics #Graph theory and applications
paper · pdf · doi:10.48550/arxiv.2408.17191
openalex publication_date 2024/08/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 π= \V1, V2, …, Vk\ of G is called a transitive partition of size k if Vi dominates Vj for all 1≤ i