2023/10/06 by Subhabrata Paul, Kamal Santra, Paul, Subhabrata +1
Computer Science · Engineering · #Advanced Graph Theory Research #Optimization and Search Problems #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2310.04036
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. A vertex partition π= \V1, V2, …, Vk\ of G is called a transitive partition of size k if Vi dominates Vj for all 1≤ i